Submission #1591927

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
 
using namespace std;
 
int main()
{
	const int MIN = -1000000;
	int N;
	int ans = MIN;
	int sum;
 
	cin >> N;
 
	vector<int> A(N);
	for (int i = 0; i < N; i++)
	{
		cin >> A[i];
	}
 
	for (int i = 0; i < N; i++)
	{
		int a_max = MIN, index = 0;
 
		for (int j = 0; j < N; j++)
		{
			if (i == j)
				continue;
 
			int a_sum = 0;
			int l = min(i, j) + 1;
			int r = max(i, j);
			while (l <= r && l < N)
			{
				a_sum += A[l];
 
				l += 2;
			}
 
			if (a_sum > a_max)
			{
				a_max = a_sum;
				index = j;
			}
		}
		
		sum = 0;
		for (int j = min(i, index); j <= max(i, index); j += 2)
		{
			sum += A[j];
		}
		if (sum > ans)
			ans = sum;
 
	}
 
	cout << ans << endl;
 
	return 0;
}

Submission Info

Judge Result