Submission #2165923

---

Source Code Expand

#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define ALL(A) A.begin(), A.end()
#define INF 1<<28

using namespace std;

typedef long long ll;
typedef pair<int, int> P;

int main()
{
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	int N; cin >> N;
	vector<int> a(N, 0);
	rep (i, N) cin >> a[i];

	int res = -INF;
	rep (i, N){
		int maxAoki = -INF;
		int maxTakahashi = -INF;
		rep (j, N){
			if (i == j) continue;
			int Aoki = 0;
			int Takahashi = 0;
			for (int k = min(i,j), c = 0; k <= max(i,j); ++k, ++c){
				if (c % 2 == 0){
					Takahashi += a[k];
				}else{
					Aoki += a[k];
				} // end if
			} // end for
			if (Aoki > maxAoki){
				maxAoki = Aoki;
				maxTakahashi = Takahashi;
			} // end if
		} // end rep
		res = max(res, maxTakahashi);
	} // end rep
	
	cout << res << endl;
	
	return 0;
}

Submission Info

Judge Result