Submission #1132636

#TimeUsernameProblemLanguageResultExecution timeMemory
1132636JelalTkmBigger segments (IZhO19_segments)C++17
0 / 100
0 ms328 KiB
#include <bits/stdc++.h>
#pragma GCC optimize ("O3")
#pragma GCC target ("sse4")

using namespace std;

#define int long long int

const int N = 3e5 + 10;
const int md = 1e9 + 7;
const int INF = 1e9;

int32_t main(int32_t argc, char *argv[]) {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  
  int T = 1;
  // cin >> T;
  while (T--) {
    int n;
    cin >> n;
    vector<int> a(n);
    for (int i = 0; i < n; i++)
      cin >> a[i];
    int sm = 0, sm2 = 0;
    int ans = 1;
    for (int i = 0; i < n; i++) {
      sm += a[i];
      sm2 = sm;
      int cnt = 1, sm1 = 0;
      for (int j = i + 1; j < n; j++) {
        sm1 += a[j];
        if (sm1 >= sm2) {
          sm2 = sm1;
          sm1 = 0;
          cnt++;
        }
      }
      ans = max(ans, cnt);
    }

    cout << ans << '\n';
  }

  return 0;
}
#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...