# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
34451 | Extazy | Hacker (BOI15_hac) | C++14 | 0 ms | 6272 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 endl '\n'
using namespace std;
const int N = 1<<19;
int n,a[N],ps[N];
int ans;
int need;
int gs(int l, int r) {
return ps[r]-ps[l-1];
}
int get_sum(int l, int r) {
if(l<0) return gs(1,r)+gs(l+n,n);
if(r>n) return gs(1,r-n)+gs(l,n);
return gs(l,r);
}
int main() {
ios_base::sync_with_stdio(false);
cin.tie(NULL);
int i;
scanf("%d", &n);
for(i=1;i<=n;i++) {
scanf("%d", &a[i]);
ps[i]=a[i]+ps[i-1];
}
need=(n+1)/2;
for(i=1;i<=n;i++) {
int curr=min(get_sum(i-need+1,i),get_sum(i,i+need-1));
ans=max(ans,curr);
}
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... |