# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
498788 | 2021-12-26T11:01:09 Z | The_Samurai | Xoractive (IZhO19_xoractive) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h> #define ll long long using namespace std; /* 3 3 1 1 */ void solve() { ll n, best = 0; cin >> n; int a[n]; for (int i = 0; i < n; i++) { cin >> a[i]; } for (int j = 0; j < n; j++) { ll s1 = 0, s2 = 0, ans = 1; for (int i = 0; i <= j; i++) { s1 += a[i]; } int i = j + 1; while (i < n) { while (i < n && s1 > s2 + a[i]) { s2 += a[i]; i++; } if (i == n && s1 > s2) { break; } s2 += a[i]; i++; s1 = s2; s2 = 0; ans++; } best = max(ans, best); } cout << best; } int main() { int t = 1; // cin >> t; while (t--) { solve(); cout << '\n'; } }