# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
146124 | evpipis | Hacker (BOI15_hac) | C++14 | 1078 ms | 1272 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>
using namespace std;
const int len = 5e5+5, inf = 1e9;
int arr[len], out[len];
int main(){
int n;
scanf("%d", &n);
for (int i = 0; i < n; i++)
scanf("%d", &arr[i]);
for (int i = 0; i < n; i++)
out[i] = inf;
int k = (n+1)/2;
for (int i = 0, j = 0, sum = 0; i < n; i++){
while ((n+j-i)%n < k){
sum += arr[j];
j = (j+1)%n;
}
for (int l = i; l != j; l = (l+1)%n)
out[l] = min(out[l], sum);
sum -= arr[i];
}
int ans = 0;
for (int i = 0; i < n; i++)
ans = max(ans, out[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... |