# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
127040 | TadijaSebez | Hacker (BOI15_hac) | C++11 | 98 ms | 22520 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 N=1000050;
int a[N];
ll sum[N],p[N];
int main()
{
int n;
scanf("%i",&n);
for(int i=1;i<=n;i++) scanf("%i",&a[i]),a[i+n]=a[i];
for(int i=1;i<=n*2;i++) sum[i]=sum[i-1]+a[i];
int sz=n+1>>1;
for(int i=1;i<=n;i++) p[i]=sum[i+sz-1]-sum[i-1];
for(int i=n+1;i<=n*2;i++) p[i]=p[i-n];
deque<int> dq;
for(int i=n-sz+2;i<=n;i++)
{
while(dq.size() && p[dq.back()]>=p[i]) dq.pop_back();
dq.push_back(i);
}
ll ans=0;
for(int i=n+1;i<=2*n;i++)
{
while(dq.size() && p[dq.back()]>=p[i]) dq.pop_back();
dq.push_back(i);
while(dq.front()<i-sz+1) dq.pop_front();
ans=max(ans,p[dq.front()]);
}
printf("%lld\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... |