# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
290741 | PeppaPig | Bigger segments (IZhO19_segments) | C++14 | 1 ms | 384 KiB |
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 long long long
using namespace std;
const int N = 5e5 + 5;
int n;
long A[N], pref[N];
int main() {
scanf("%d", &n);
for(int i = 1; i <= n; i++) {
scanf("%lld", A + i);
pref[i] = pref[i - 1] + A[i];
}
int ans = 0, idx = 0;
long sum = 0;
for(int i = 1; i <= n; i++) if(pref[i] - pref[idx] >= sum) {
++ans;
while(idx + 1 < i && pref[i] - pref[idx + 1] >= sum + A[idx + 1])
sum += A[++idx];
sum = pref[i] - pref[idx];
idx = i;
}
printf("%d\n", ans);
return 0;
}
Compilation message (stderr)
# | 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... |