#include <bits/stdc++.h>
using namespace std;
int n,a[1000007],pre[1000007],ans=0;
deque <int> cur;
int main(){
ios_base::sync_with_stdio(0);
cin>>n;
for(int i=1;i<=n;i++){
cin>>a[i];
a[n+i]=a[i];
}
int sz=(n/2)+(n%2);
for(int i=1;i<=sz;i++){
pre[1]+=a[i];
}
for(int i=2;i<=n;i++){
pre[i]=pre[i-1]+a[i+sz-1]-a[i-1];
}
for(int i=n+1;i<=2*n;i++) pre[n+i]=pre[i];
for(int i=1;i<=2*n;i++){
while(!cur.empty() && pre[cur.back()]>=pre[i]) cur.pop_back();
cur.push_back(i);
if(i-cur.front()==sz) cur.pop_front();
if(i>=sz) ans=max(ans,pre[cur.front()]);
}
cout<<ans;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
9988 KB |
Output is correct |
2 |
Correct |
0 ms |
9988 KB |
Output is correct |
3 |
Correct |
0 ms |
9988 KB |
Output is correct |
4 |
Correct |
0 ms |
9988 KB |
Output is correct |
5 |
Correct |
0 ms |
9988 KB |
Output is correct |
6 |
Correct |
0 ms |
9988 KB |
Output is correct |
7 |
Correct |
0 ms |
9988 KB |
Output is correct |
8 |
Correct |
0 ms |
9988 KB |
Output is correct |
9 |
Correct |
0 ms |
9988 KB |
Output is correct |
10 |
Correct |
0 ms |
9988 KB |
Output is correct |
11 |
Correct |
0 ms |
9988 KB |
Output is correct |
12 |
Incorrect |
0 ms |
9988 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
9988 KB |
Output is correct |
2 |
Correct |
0 ms |
9988 KB |
Output is correct |
3 |
Correct |
0 ms |
9988 KB |
Output is correct |
4 |
Correct |
0 ms |
9988 KB |
Output is correct |
5 |
Correct |
0 ms |
9988 KB |
Output is correct |
6 |
Correct |
0 ms |
9988 KB |
Output is correct |
7 |
Correct |
0 ms |
9988 KB |
Output is correct |
8 |
Correct |
0 ms |
9988 KB |
Output is correct |
9 |
Correct |
0 ms |
9988 KB |
Output is correct |
10 |
Correct |
0 ms |
9988 KB |
Output is correct |
11 |
Correct |
0 ms |
9988 KB |
Output is correct |
12 |
Incorrect |
0 ms |
9988 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
9988 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
9988 KB |
Output is correct |
2 |
Correct |
0 ms |
9988 KB |
Output is correct |
3 |
Correct |
0 ms |
9988 KB |
Output is correct |
4 |
Correct |
0 ms |
9988 KB |
Output is correct |
5 |
Correct |
0 ms |
9988 KB |
Output is correct |
6 |
Correct |
0 ms |
9988 KB |
Output is correct |
7 |
Correct |
0 ms |
9988 KB |
Output is correct |
8 |
Correct |
0 ms |
9988 KB |
Output is correct |
9 |
Correct |
0 ms |
9988 KB |
Output is correct |
10 |
Correct |
0 ms |
9988 KB |
Output is correct |
11 |
Correct |
0 ms |
9988 KB |
Output is correct |
12 |
Incorrect |
0 ms |
9988 KB |
Output isn't correct |
13 |
Halted |
0 ms |
0 KB |
- |