Submission #1181622

#TimeUsernameProblemLanguageResultExecution timeMemory
1181622nuutsnoyntonBigger segments (IZhO19_segments)C++20
0 / 100
0 ms328 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; int main() { ll n, m, s, sum, r, x, y, i, j, ans, t, cnt; cin >> n; ll a[n + 2]; for (i = 1; i <= n; i ++) { cin >> a[i]; } s =0 ; ans = 0; for (i = 1; i <= n; i ++) { s += a[i]; sum =0; cnt = 1; for (j = i + 1; j <= n; j ++) { sum += a[j]; if ( sum >= s) { sum = 0; cnt ++; } } // if ( sum == 0) cnt --; ans = max(ans, cnt); } cout << ans << endl; }
#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...