# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
907348 | Mathias | Hacker (BOI15_hac) | C++14 | 274 ms | 26712 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;
#define ll long long
const int MAXN = 1e6+7;
ll pref[MAXN];
ll t[MAXN];
multiset<ll> ms;
int main(){
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
ll n,r1,r2,k,r=0;
cin>>n;
for(int i=1;i<=n;i++){
cin>>t[i];
pref[i]=pref[i-1]+t[i];
}
for(int i=n+1;i<=2*n;i++) pref[i]=pref[i-1]+t[i-n];
for(int i=1;i<=(n+1)/2;i++){
ms.insert(pref[i+(n+1)/2-1]-pref[i-1]);
}
for(int i=1;i<=n;i++){
k=i+(n+1)/2;
ms.erase(ms.find(pref[k-1]-pref[i-1]));
ms.insert(pref[k+(n+1)/2-1]-pref[k-1]);
r=max(r,*ms.begin());
}
cout<<r<<'\n';
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... |