Submission #1369250

---

Source Code Expand

#include<iostream>
#include<string>
#include<cmath>
#include<queue>
#include<map>
#include<set>
#include<list>
#include<iomanip>
#include<vector>
#include<functional>
#include<algorithm>
#include<cstdio>
#include<unordered_map>
#define int long long
#define rep(i,a,n) for (int (i)=(a);(i)<(n);(i)++)
using namespace std;
typedef long long ll;
typedef long double ld;
signed  main() {
	int n, a[50];
	cin >> n;
	for (int i = 0; i < n; i++)
		cin >> a[i];
	int ans = -10000000;
	for (int i = 0; i < n; i++) {
		int sum = -1000000, sum2 = -10000000;
		for (int j = n - 1; j >= 0; j--) {
			int b = 0, c = 0;
			for (int z = min(i, j); z <= max(i, j); z++) {
				if ((z - min(i, j)) % 2 == 0)
					b += a[z];
				else
					c += a[z];
			}
			if (sum2 <= c) 
				sum = b, sum2 = c;
		}
		ans = max(ans, sum);
	}
	cout << ans << endl;
	getchar(); getchar();
}

Submission Info

Judge Result