Submission #2203359

---

Source Code Expand

#include "bits/stdc++.h"
using namespace std;
#define ll long long int
#define rep(i,n) for( int i = 0; i < n; i++ )
#define REP(i,s,t) for( int i = s; i <= t; i++ )
#define dump(x)  cerr << #x << " = " << (x) << endl;
#define INF 2000000000
#define mod 1000000007
#define INF2 1000000000000000000

int N;
int a[51];


int game(string P, int A, int B) {
    if (A > B) return game(P, B, A);
    int takaP = 0;
    int aokiP = 0;
    int j = 0;
    REP(i, A, B) {
        if (j % 2 == 0) takaP += a[i];
        else aokiP += a[i];
        j++;
    }
    if (P == "taka") return takaP;
    else if (P == "aoki") return aokiP;
}

int main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);
    cin >> N;
    rep(i, N) cin >> a[i];
    int takaP = -INF;
    rep(i, N) {        
        int aokiP = -INF;
        int aokiidx = -1;
        rep(j, N) {
            int tmpP = game("aoki", i, j); 
            if (aokiP < tmpP) {
                aokiP = tmpP;
                aokiidx = j;
            }
        }
        takaP = max(takaP, game("taka", i, aokiidx));
        //cout << i << " " << aokiidx << endl;
        //dump(game("taka", i, aokiidx));
    }
    cout << takaP << endl;

    return 0;
}

Submission Info

Judge Result