Submission #575523

---

Source Code Expand

#include<iostream>
#include<cstdio>
#include<vector>
#include<queue>

#include<map>
#include<set>
#include<string>
#include<algorithm>
#include<functional>
using namespace std;
#define FOR(i,a,b) for (int i=(a);i<(b);i++)
#define RFOR(i,a,b) for (int i=(b)-1;i>=(a);i--)
#define REP(i,n) for (int i=0;i<(n);i++)
#define RREP(i,n) for (int i=(n)-1;i>=0;i--)
#define INF 1<<30
#define MP make_pair
#define mp make_pair
#define pb push_back
#define PB push_back
#define DEBUG(x) cout<<#x<<": "<<x<<endl
#define ll long long
#define ull unsigned long long
int n;
int main(){
cin.tie(0);
ios::sync_with_stdio(false);
	cin>>n;
	int a[n];
	REP(i,n) cin>>a[i];
	int ma=-INF;
	REP(i,n){
		int aosum = -INF;
		int id=-1;
		FOR(j,0,n){
			if(i==j) continue;
			int tmp=0;
			for(int k=min(i,j)+1;k<=max(i,j);k+=2){
				tmp += a[k];
			}
			if(aosum <tmp) id=j, aosum=tmp;
		}
		int tmp=0;
		for(int k=min(i,id);k<=max(id,i);k+=2) tmp +=a[k];
		ma=max(tmp,ma);
	}
	cout<<ma<<endl;

}

Submission Info

Judge Result