This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define prev prev1231412412
#define ll long long
using namespace std;
const int N = (int)5e5 + 5;
ll a[N];
int n;
int calc(int pref) {
  int prev = 0;
  int cnt = 1;
  for (int i = 1; i <= pref; i++) {
    prev += a[i];
  }
  for (int i = pref + 1; i <= n; i++) {
    int sum = 0;
    int j = i;
    while (j <= n && sum < prev) {
      sum += a[j], j++;
    }
    if (sum < prev) {
      break;
    }
    cnt++;
    prev = sum;
    i = j - 1;
  }
  return cnt;
}
signed main() {
  ios::sync_with_stdio(0); cin.tie(0);
  cin >> n;
  for (int i = 1; i <= n; i++) {
    cin >> a[i];
  }
  int ans = 0;
  for (int i = 1; i <= n; i++) {
    ans = max(ans, calc(i));
  }
  cout << ans;
}
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... | 
| # | Verdict  | Execution time | Memory | Grader output | 
|---|
| Fetching results... |