Submission #575415

---

Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <math.h>
#include <vector>
#include <queue>
#include <algorithm>
#include <sstream>
#include <string>
#include <map>

using namespace std;

#define FOR(I,N) for(int I = 0; I < (int)(N); I++)
#define FIN(V) cout<<V<<endl
#define pb push_back
#define INF (1 << 30)

typedef pair<int, int> P;

string sValueOf(int v){stringstream ss;ss<<v;return ss.str();}
int parseInt(string v){int i;stringstream ss(v);ss>>i;return i;}
void fast_io() {cin.tie(0); ios::sync_with_stdio(false);}

int vs[51];
int n;
P scoring(int t,int a){
	int l = min(t,a);
	int r = max(t,a);
	int s1 = 0;
	int s2 = 0;
	for(int i = l;i<=r;i++){
		if((l-i)%2==0){///
			s1+=vs[i];
		}else{
			s2+=vs[i];
		}
	}
	return P(s1,s2);
}

int main(){
	int i,j;
	cin>>n;
	FOR(i,n){
		cin>>vs[i];
	}
	int ansf = -INF;
	FOR(i,n){///高橋君が選ぶ場所
		int ans = -INF;
		int maxi = -INF;
		FOR(j,n){
			if(j==i)continue;
			P s = scoring(i,j);
			if(maxi<s.second){
				ans = s.first;
				maxi = s.second;
			}
		}
		ansf = max(ansf,ans);
	}
	cout<<ansf<<endl;
	return 0;
}

Submission Info

Judge Result