Submission #685376

#TimeUsernameProblemLanguageResultExecution timeMemory
685376OrazBBigger segments (IZhO19_segments)C++14
0 / 100
1 ms212 KiB
#include <bits/stdc++.h> #define N 500005 #define wr cout << "Continue debugging\n"; #define all(x) (x).begin(), (x).end() #define ll long long int #define pii pair <int, int> #define pb push_back #define ff first #define ss second using namespace std; int a[N]; int main () { ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; for (int i = 1; i <= n; i++){ cin >> a[i]; } ll sum = 0; int mx = 0; for (int i = 1; i <= n; i++){ sum += a[i]; ll sm = 0, old = sum; int cnt = 1; for (int j = i+1; j <= n; j++){ sm += a[j]; if (sm >= old){ old = sm; sm = 0; cnt++; } } if (sm) cnt--; mx = max(mx, cnt); } cout << mx; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...