Submission #2853260

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <cmath>
#include <iomanip>
#include <vector>
#include <utility>
#include <numeric>
#include <string>
#include <set>
#include <map>
#include <tuple>
#include <queue>
#include <stack>
#include <deque>
#define rep(i, a, n) for(int (i) = (int)(a);(i) < (int)(n);++(i))
#define repe(i, a, n) for(int (i) = (int)(a);(i) <= (int)(n);++(i))
#define repif(i, a, x) for(int (i) = (int)(a);(x);++(i))
#define repr(i, a, n) for(int (i) = (int)(a);(i) > (int)(n);--(i))
#define reper(i, a, n) for(int (i) = (int)(a);(i) >= (int)(n);--(i))
#define SIZE(x) ((int)(x).size())
#define ALL(x) (x).begin(), (x).end()
#define RNG(x, n) &((x)[0]), &((x)[n])
#define BRK(x) { (x); break; }
#define ADD(a, b) ((((a)%MOD)+((b)%MOD))%MOD)
#define MUL(a, b) ((((a)%MOD)*((b)%MOD))%MOD)
#define FLOOR(x) ((int)floor(((double)x)))
#define CEIL(x) ((int)ceil(((double)x)))
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define Yes cout << "Yes" << endl
#define No cout << "No" << endl
#define yes cout << "yes" << endl;
#define no cout << "no" << endl;
#define fcout cout << fixed << setprecision(10)
#define pb push_back
#define pf push_front
#define mt make_tuple
#define fi first
#define se second
#define EPS (1e-20)
#define INF 2147483647
#define MOD 1000000007
using llint = long long;
using VI = std::vector<int>;
using PII = std::pair<int, int>;
using SI = std::set<int>;
using MII = std::map<int, int>;
using TIII = std::tuple<int, int, int>;
using VLL = std::vector<llint>;
using MCI = std::map<char, int>;
using namespace std;


int N;
int a[60];
int T[60][60];
int A[60][60];


void makeTA(){
	rep(i, 0, N){
		rep(j, 0, N){
			if(i == j) T[i][j] = A[i][j] = -INF;
			else if(i < j){
				repe(k, i, j){
					if((k-i)%2 == 0) T[i][j] += a[k];
					else A[i][j] += a[k];
				}
			}
			else {
				repe(k, j, i){
					if((k-j)%2 == 0) T[i][j] += a[k];
					else A[i][j] += a[k];
				}
			}
		}
	}
}


int solve(){
	int ans = -INF;
	rep(i, 0, N)
		ans = max(ans, T[i][max_element(RNG(A[i], N))-&A[i][0]]);
	return ans;
}

signed main(){
	cin >> N;
	rep(i, 0, N) cin >> a[i];

	makeTA();

	cout << solve() << endl;

	return 0;
}

Submission Info

Judge Result