# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
31423 | imaxblue | Hacker (BOI15_hac) | C++14 | 793 ms | 25484 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
#define mp make_pair
#define pb push_back
#define x first
#define y second
#define pii pair<int, int>
#define p3i pair<pii, int>
#define pll pair<ll, ll>
#define p3l pair<pll, ll>
#define lseg L, (L+R)/2, N*2+1
#define rseg (L+R)/2+1, R, N*2+2
#define ub upper_bound
#define lb lower_bound
#define pq priority_queue
#define MN 1000000007
#define fox(k, x) for (int k=0; k<x; ++k)
#define fox1(k, x) for (int k=1; k<=x; ++k)
#define foxr(k, x) for (int k=x-1; k>=0; --k)
#define fox1r(k, x) for (int k=x; k>0; --k)
#define ms multiset
#define flood(x) memset(x, 0x3f3f3f3f, sizeof x)
#define drain(x) memset(x, 0, sizeof x)
#define rng() (rand() >> 3)*rand()
int n, ans=(1 << 30)+(1 << 29), c;
ll psa[1500005];
multiset<int> s;
int main(){
scanf("%i", &n);
fox1(l, n){
scanf("%i", &psa[l]);
psa[l+n]=psa[l];
c+=psa[l];
}
fox1(l, n*3){
psa[l]+=psa[l-1];
}
for(int l=n/2; l<=n*2; ++l){
s.insert(psa[l]-psa[l-n/2]);
if (s.size()>(n+1)/2) s.erase(s.lb(psa[l-(n+1)/2]-psa[l-n]));
if (s.size()==(n+1)/2) ans=min(ans, *--s.end());
}
cout << c-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... |