Submission #1550749

---

Source Code Expand

#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstdio>
#include <cmath>
#include <cstdlib>
#include <cstring>
#include <stack>
#include <queue>
#include <set>
#include <map>
#include <utility>
#include <ctime>
#define INF 2000000000
#define LINF 9000000000000000000
#define mod 1000000007
 
#define rep(i,n) for(int i=0;i<int(n);i++)
#define rrep(i,n) for(int i=(n);i>=0;i--)
#define REP(i,a,b) for(int i=(a);i<int(b);i++)
#define all(x) (x).begin(),x.end()
#define pb push_back
#define mp make_pair
#define MOD(x) (x%(mod))
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
typedef vector<int> vi;
typedef pair<int,int> pi;
 
int dx[4]={1,0,-1,0};
int dy[4]={0,1,0,-1};

bool debug=false;
/*---------------------------------------------------*/

int main(){
  int n,a[55];
  vi ans;
  cin>>n;
  rep(i,n)cin>>a[i];
  REP(i,0,n){
    pi p=mp(-INF,-INF);
    REP(j,0,n){
      if(i==j)continue;
      int cnt=1;
      int t=0,o=0;
      REP(k,min(i,j),max(i,j)+1){
	if(cnt%2==0)o+=a[k];
	else t+=a[k];
	cnt++;
      }
      //cout<<"DEBUG: i"<<i<<"  j: "<<j<<"  ||  "<<t<<" "<<o<<endl;
      if(p.second<o)p=mp(t,o);
    }
    ans.pb(p.first);
  }
  sort(all(ans));
  reverse(all(ans));
  cout<<ans[0]<<endl;
  
  return 0;
}

Submission Info

Judge Result