제출 #126417

#제출 시각아이디문제언어결과실행 시간메모리
126417VardanyanHacker (BOI15_hac)C++14
0 / 100
2 ms504 KiB
#include <bits/stdc++.h>
using namespace std;

const int N = 500*1000+5;
int a[N];
int main(){
    ios_base::sync_with_stdio(false);
    int n;
    cin>>n;
    for(int i = 1;i<=n;i++) cin>>a[i];
    int k = (n+1)/2;
    int ans = 0;
    for(int i = 1;i<=n;i++){
        int kk = k;
        int x,y;
        x = y = 0;
        int ind = i;
        while(kk--){
            x+=a[ind];
            if(ind+1<=n) ind++;
            else ind = 1;
        }
        kk = k;
        while(kk--){
            y+=a[ind];
            if(ind-1>=1) ind--;
            else ind = n;
        }
        x = min(x,y);
        ans = max(ans,x);
    }
    cout<<ans<<endl;
    return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...