adding files

Author: DsThakurRawat

1343C.cpp

@@ -0,0 +1,57 @@
+/*
+DIVYANSH RAWAT
+MASTER TEMPLATE
+*/
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+
+#define nl '\n'
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+void solve() {
+    return;
+}
+
+void MASTER() {
+    ll n;cin>>n;
+    vector<ll>a(n);for(auto & in : a)cin>>in;
+    ll i = 0;
+    ll sum = 0;
+    while(i < n){
+      ll j = i;
+      ll put = a[i];
+     if(a[i] < 0){
+        while(j<n && a[j] < 0 ){
+            put = max(put,a[j]);
+            j++;
+        }
+     }
+     else{
+        while(j<n&&a[j] > 0){
+            put = max(put,a[j]);
+            j++;
+        }
+     }
+     sum +=put;
+     i=j;
+
+    }
+    cout << sum << nl;
+
+    }
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        MASTER();
+        solve();
+    }
+
+    return 0;
+}

1354B.cpp

@@ -0,0 +1,84 @@
+/*
+DIVYANSH RAWAT
+MASTER TEMPLATE
+*/
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+
+#define nl '\n'
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+void solve() {
+    return;
+}
+
+void MASTER(){
+
+        string s;cin>>s;
+        int flag1 = 0;
+        int flag2 = 0;
+        int flag3 = 0;
+
+        for(int i = 0;i<s.size();i++){
+            if(s[i] =='1')flag1 = 1;
+            if(s[i]=='2')flag2 = 1;
+            if(s[i]=='3')flag3=1;
+        }
+        if(flag1 == 0 || flag2==0 || flag3==0){
+            cout << 0 <<nl;
+            return;
+        }
+
+    int i = 0;
+    int n = s.size();
+    int maxi = -1;
+    int len = -1;
+    while(i<n){
+        int j = 0;
+        int f1 = 0,f2 = 0,f3=0;
+        while(j<=i){
+         if(s[j]=='1')f1=1;
+         if(s[j]=='2')f2=1;
+         if(s[j]=='3')f3=1;
+         j++;
+        }
+        if(f1==1 && f2 == 1 && f3 ==1 ){
+             len = i-j+1;
+        }
+        maxi = max(len,maxi);
+        i++;
+    }
+
+    cout << maxi << nl;
+
+
+
+
+
+
+
+      
+    
+
+
+
+
+}
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    t = 1;
+    cin >> t;
+    while (t--) {
+        MASTER();
+        solve();
+    }
+
+    return 0;
+}

1399C.cpp

@@ -0,0 +1,36 @@
+/*
+DIVYANSH RAWAT
+MASTER TEMPLATE
+*/
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+
+#define nl '\n'
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+void solve() {
+    return;
+}
+
+void MASTER() {
+    ll n;cin>>n;
+    vector<ll>a(n);for(auto & in : a)cin>>in;
+   
+
+    }
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        MASTER();
+        solve();
+    }
+
+    return 0;
+}

1692E.cpp

@@ -0,0 +1,64 @@
+/*
+DIVYANSH RAWAT
+MASTER TEMPLATE
+*/
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+
+#define nl '\n'
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+void solve() {
+    return;
+}
+
+void MASTER(){
+  ll n,s;cin>>n>>s;
+  vector<ll>a(n);for(auto & x : a)cin>>x;
+  ll sum = 0;
+  ll ans = n+1;
+   int j = 0;
+  for(int i = 0;i<n;i++){
+   
+    while(j<n&&sum + a[j] <=s){
+      sum +=a[j];
+      j++;
+    }
+    if(sum==s){
+      ans = min(ans,n-(j-i));
+    }
+    sum -=a[i];
+  }
+  if(ans > n){
+    ans =-1;
+  }
+  cout << ans << nl;
+
+
+
+
+
+
+
+
+
+
+}
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    t = 1;
+   cin >> t;
+    while (t--) {
+        MASTER();
+        solve();
+    }
+
+    return 0;
+}

1729D.cpp

@@ -1,52 +0,0 @@
-/*
-DIVYANSH RAWAT
-MASTER TEMPLATE
-*/
-#include <bits/stdc++.h>
-using namespace std;
-
-using ll = long long;
-
-#define nl '\n'
-
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-void solve() {
-    return;
-}
-ll fx(ll &x){
-    string s = to_string(x);
-    ll sum = 0;
-
-    for(int i = 0;i<s.size();i++){
-        sum += s[i]-'0';
-    }
-    return sum;
-
-
-
-}
-void MASTER() {
-   
-ddd 
-
-
-
-
-
-
-
-    }
-int main(){
-    ios::sync_with_stdio(false);
-    cin.tie(nullptr);
-
-    int t;
-    cin >> t;
-    while (t--) {
-        MASTER();
-        solve();
-    }
-
-    return 0;
-}

1793D.cpp

@@ -0,0 +1,80 @@
+/*
+DIVYANSH RAWAT
+MASTER TEMPLATE
+*/
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+
+#define nl '\n'
+
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+void solve() {
+    return;
+}
+ll Fx(ll &x){
+    string s = to_string(x);
+    ll sum = 0;
+
+    for(int i = 0;i<s.size();i++){
+        sum += s[i]-'0';
+    }
+    return sum;
+
+
+
+}
+void MASTER() {
+    ll n;cin>>n;
+    vector<ll>a(n);for(auto & x : a)cin>>x;
+
+    int l =0;
+    int r = n-1;
+    ll mn = 1;
+    ll mx = n;
+
+    while(l<=r){
+        if (a[l] == mn) {
+            l++;
+            mn++;
+        } else if (a[l] == mx) {
+            l++;
+            mx--;
+        } else if (a[r] == mn) {
+            r--;
+            mn++;
+        } else if (a[r] == mx) {
+            r--;
+            mx--;
+        } else {
+            break;
+        }
+    }
+    if(l<=r){
+        cout << l + 1 << " " << r + 1 << nl;
+        return;
+    }
+    cout << -1 << nl;
+ 
+
+
+
+
+
+
+    }
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        MASTER();
+        solve();
+    }
+
+    return 0;
+}