# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
544722 | rainboy | Hacker (BOI15_hac) | C11 | 75 ms | 7224 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 max(int a, int b) { return a > b ? a : b; }
int main() {
static int aa[N], ss[N], qu[N * 2];
int n, k, i, head, cnt, ans;
scanf("%d", &n), k = (n + 1) / 2;
for (i = 0; i < n; i++) {
scanf("%d", &aa[i]);
if (i * 2 < n)
ss[0] += aa[i];
}
for (i = 1; i < n; i++)
ss[i] = ss[i - 1] - aa[i - 1] + aa[(i + k - 1) % n];
head = cnt = 0, ans = 0;
for (i = 0; i < n + k; i++) {
while (cnt && ss[qu[head + cnt - 1] % n] >= ss[i % n])
cnt--;
qu[head + cnt++] = i;
if (i >= k - 1) {
ans = max(ans, ss[qu[head] % n]);
if (qu[head] == i - k + 1)
head++, cnt--;
}
}
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... |