Submission #575881

---

Source Code Expand

#include <iostream>
#include <algorithm>
using namespace std;

int main()
{

	int N,a[54];
	cin >> N;
	for (int i = 0; i < N; i++)	cin >> a[i];
	int Tm = -50;
	for (int i = 0; i < N; i++) {
		int Am = -50, t = -50;
		for (int j = 0; j < N; j++) {
			if (i == j)continue;
			int T = 0, A = 0;
			for (int k = min(i, j); k <= max(i, j); k += 2) {
				T += a[k];
				if (k < max(i,j)) A += a[k + 1];
			}
			if (Am < A) {
				Am = A;
				t = T;
			}
		}
		if (Tm < t)	Tm = t;
	}
	cout << Tm << endl;
	return 0;
}

Submission Info

Judge Result