Submission #1691600

---

Source Code Expand

#include <bits/stdc++.h>
#define REP(i,a,b) for(int i=(a);i<(b);i++)
#define RREP(i,a,b) for(int i=(a);i>=(b);i--)
typedef long long ll; typedef long double ld;
using namespace std;
const int INF=1e9, MOD=1e9+7, around[]={0,1,1,-1,0,-1,1,0,0};
const ld PI=abs(acos(-1));
int n,k,a[100010];

int main(){
	cin >> n;
	REP(i,0,n) cin >> a[i];
	
	int ma=-INF;
	REP(i,0,n){
		int pos=0,tmp=0;
		vector<pair<int,int>> vec;
		REP(j,0,n){
			if(i==j) continue;
			else{
				int s=0,w=0;
				REP(k,min(i,j),max(i,j)+1){
					if(k%2==min(i,j)%2) w+=a[k];
					else s+=a[k];
				}
				if(pos<s) pos=s,tmp=w;
			}
		}
		ma=max(ma,tmp);
	}
	
	
	cout << ma << endl;
	return 0;
}

Submission Info

Judge Result