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>
const int N = 5e5 + 5;
using namespace std;
deque <int> mq;
int n, a[N], sum[2*N], maxx, siz;
int main(){
ios_base::sync_with_stdio(false); cin.tie(0);
cin >> n;
siz = (n+1)/2;
for (int i = 1; i <= n; i++) cin >> a[i];
for (int i = 1; i <= siz; i++) sum[1] += a[i];
for (int i = 2; i <= n; i++){
sum[i] = sum[i-1] + a[i-1+(n+1)/2] - a[i-1];
}
for (int i = 1; i <= n; i++){
sum[n+i] = sum[i];
}
for (int i = 1; i <= 2*n; i++){
while(mq.size() && sum[mq.front()] > sum[i]) mq.pop_front();
mq.push_back(i);
if (i - mq.back() >= (n+1)/2) mq.pop_back();
maxx = max(sum[mq.back()], maxx);
}
cout << maxx;
}
# | 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... |