# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
84707 | rzbt | Hacker (BOI15_hac) | C++14 | 520 ms | 37252 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 mp make_pair
#define pb push_back
#define F first
#define S second
#define all(x) x.begin(),x.end()
#define MAXN 500005
typedef long long ll;
using namespace std;
int n;
int niz[MAXN+MAXN];
int zbir[MAXN];
multiset<int> s;
int res=0;
int main()
{
scanf("%d", &n);
for(int i=1;i<=n;i++){
int t;
scanf("%d", &t);
niz[i]=niz[n+i]=t;
}
for(int i=1;i<=n/2+(n&1);i++){
zbir[1]+=niz[i];
}
for(int i=2;i<=n;i++){
zbir[i]=zbir[i-1]+niz[i+n/2+(n&1)-1]-niz[i-1];
}
//printf("ok ");
for(int i=1;i<=n/2+(n&1);i++){
s.insert(zbir[i]);
}
//printf("this ");
res=*s.begin();
for(int i=2;i<=n;i++){
s.erase(s.find(zbir[i-1]));
s.insert(zbir[(i+n/2+(n&1)-2)%n+1]);
res=max(res,*s.begin());
}
printf("%d",res);
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... |