Submission #478381

#	Time	Username	Problem	Language	Result	Execution time	Memory
478381		MilosMilutinovic	Bigger segments (IZhO19_segments)	C++14	0 / 100	1 ms	208 KiB

segments

/**
 *    author: m371
 *    created: 07.10.2021 08:30:44
**/
#include <bits/stdc++.h>

using namespace std;

int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n;
  cin >> n;
  vector<int> a(n);
  for (int i = 0; i < n; i++) {
    cin >> a[i];
  }
  long long sum = 0, curr = 0;
  int ans = 0;
  for (int i = 0, j = 0; i < n; i++) {
    sum += a[i];
    if (sum >= curr) {
      while (curr + a[j] <= sum - a[j]) {
        curr += a[j];
        sum -= a[j];
        j += 1;
      }
      curr = sum;
      sum = 0;
      ans++; 
      j = i + 1;
    }
  }
  cout << ans << '\n';
  return 0;
}

• Subtask 1: 0 / 13
• Subtask 2: 0 / 14
• Subtask 3: 0 / 10
• Subtask 4: 0 / 36
• Subtask 5: 0 / 27