Submission #2114803

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ull = unsigned long long;
#define MOD 1000000007

int n;
int a[50];

int sum(int l,int r,bool t){
  if(r<l) swap(l,r);
  int res=0;
  for(int i=l;i<=r;i++){
    if((i+1-l)%2==t) res+=a[i];
  }
  return res;
}

int main(){
  int n;
  cin>>n;
  for(int i=0;i<n;i++) cin>>a[i];
  int ans=-3000;
  for(int i=0;i<n;i++){
    int aok=-3000, ind=-1;
    for(int j=0;j<n;j++){
      if(i==j) continue;
      int tmp=sum(i,j,0);
      if(aok<tmp){
        aok=tmp;
        ind=j;
      }
    }
    ans=max(ans,sum(i,ind,1));
  }
  cout<<ans<<endl;
  return 0;
}

Submission Info

Judge Result