Submission #1626117

---

Source Code Expand

#include<bits/stdc++.h>
typedef long long ll;
using namespace std;
int INF = 1e9;
int MOD = 1e9+7;
main(){
    int N;
    cin >> N;
    vector<int> A(N);
    for(int i = 0;i < N;i++)cin >> A[i];
    int maxT = -INF;
    //i ~ jの和
    for(int i = 0;i < N;i++){
        int maxA = -INF,maxl,maxr;
        for(int j = 0;j < N;j++){
            if(i == j)continue;
            int sum = 0;
            for(int k = min(i,j)+1;k <= max(i,j);k+=2){
                sum += A[k];
            }
            if(maxA < sum){
                maxA = sum;
                maxl = min(i,j);
                maxr = max(i,j);
            }
        }
        int sum = 0;
        for(int j = maxl;j <= maxr;j+=2){
            sum += A[j];
        }
        maxT = max(maxT,sum);
    }
    cout << maxT << endl;
}   

Submission Info

Judge Result