Submission #2115712

---

Source Code Expand

#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
typedef pair<LL,LL> P;
const LL mod=1e9+7;
const LL LINF=1LL<<62;

int main(){
    int N;
    cin >> N;
    int a[N];
    for(int i=0;i<N;i++){
        cin >> a[i];
    }
    int ans=-100;
    for(int i=0;i<N;i++){
        int maxi=-100;
        int temp=-100;
        for(int j=N-1;j>=0;j--){
            if(i==j) continue;
            int aoki=0,taka=0;
            for(int s=min(i,j);s<=max(i,j);s+=2){
                taka+=a[s];
            }
            for(int s=min(i,j)+1;s<=max(i,j);s+=2){
                aoki+=a[s];
            }
            if(temp<=aoki){
                temp=aoki;
                maxi=taka;
            }
        }
        ans=max(maxi,ans);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result