# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
770119 | rainboy | Bigger segments (IZhO19_segments) | C11 | 50 ms | 16780 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 <stdio.h>
#define N 500000
int main() {
static long long aa[N + 1], bb[N + 1];
static int pp[N + 1], qu[N + 1];
int n, cnt, h, i;
scanf("%d", &n);
for (i = 1; i <= n; i++) {
scanf("%lld", &aa[i]);
aa[i] += aa[i - 1];
}
pp[0] = 0, bb[0] = 0;
cnt = 0;
qu[cnt++] = 0;
for (h = 0, i = 1; i <= n; i++) {
while (h + 1 < cnt && bb[qu[h + 1]] <= aa[i])
h++;
pp[i] = qu[h], bb[i] = aa[i] * 2 - aa[pp[i]];
while (cnt && bb[qu[cnt - 1]] >= bb[i])
cnt--;
qu[cnt++] = i;
}
i = n, cnt = 0;
while (i > 0)
i = pp[i], cnt++;
printf("%d\n", cnt);
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... |