Submission #843409

---

Source Code Expand

#include<bits/stdc++.h>
#define range(i,a,b) for(int i = (a); i < (b); i++)
#define rep(i,b) range(i,0,b)
#define pb(a) push_back(a)
#define all(a) (a).begin(), (a).end()
#define debug(x) cout << "debug " << x << endl;
#define INF (1 << 30)
using namespace std;

inline bool add(int a){ return a % 2; }
inline bool even(int a){ return !(a % 2); }
inline bool add(long long a){ return a % 2; }
inline bool even(long long a){ return !(a % 2); }

int a[55];



struct Scores{
    int taka, ao;
    Scores();
};

Scores::Scores(){
    taka = -1 * INF;
    ao = -1 * INF;
}

Scores requestBothScores(int first, int last){
    Scores retval;
    retval.taka = 0;
    retval.ao = 0;

    int alternate = 0;
    for(int i = first; i <= last; i++){
        if(even(alternate)) retval.taka+=a[i];
        else retval.ao+=a[i];
        alternate++;
    }
    return retval;
}

int requestHighestScore(int n){
    Scores hightestScoreOfTakahashi;

    rep(i,n){
        Scores highestScoreOfaoki;
        for(int j = n - 1; j >= 0; j--){
            if(i ==  j) continue;
            Scores tmp;

            if(i < j) tmp = requestBothScores(i, j);
            else tmp = requestBothScores(j, i);

            if(tmp.ao >= highestScoreOfaoki.ao){
                highestScoreOfaoki = tmp;
            }
        }
        if(highestScoreOfaoki.taka >= hightestScoreOfTakahashi.taka){
            hightestScoreOfTakahashi = highestScoreOfaoki;
        }
    }
    return hightestScoreOfTakahashi.taka;
}

int main(){
    int n;
    cin >> n;
    rep(i,n) cin >> a[i];
    cout << requestHighestScore(n) << endl;
}

Submission Info

Judge Result