# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
103029 | pavel | Hacker (BOI15_hac) | C++14 | 2 ms | 256 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 <cstdio>
#include <algorithm>
using namespace std;
const int MAXN = 500005;
int n;
int a[MAXN];
int sum[MAXN];
int main(){
scanf("%d", &n);
for(int i=0;i<n;++i) scanf("%d", &a[i]);
for(int i=0;i<(n+1)/2;++i) sum[0]+=a[i];
for(int i=1;i<n;++i){
sum[i]=sum[i-1]-a[i-1]+a[((i+(n+1)/2)-1+n)%n];
}
int sol=-1;
for(int i=0;i<n;++i){
sol=max(sol, min(sum[i], sum[(i+(n+1)/2-1+n)%n]));
}
printf("%d", sol);
}
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... |