Submission #2199195

---

Source Code Expand

#include<vector>
#include<iostream>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<functional>
#include<queue>
#include<stack>
#include<string.h>
#include<list>
#include<limits>
#include<bitset>
#include<ctype.h>
#include<set>
using namespace std;
typedef long long int ll;
typedef pair<ll,int> P;
const ll MOD=1000000007LL;
const ll INF=1000000000;
const int MAX=100001;
const double EPS=1e-10;
int main(){
    int n;
    cin>>n;
    int a[51];
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int ans=-INF;
    for(int i=0;i<n;i++){
        int aom=-INF;
        int tam;
        for(int j=0;j<n;j++){
            if(i==j){
                continue;
            }
            int ao=0;
            int ta=0;
            if(i>j){
                for(int k=0;k<=i-j;k++){
                    if(k%2==0){
                        ta+=a[k+j];
                    }else{
                        ao+=a[k+j];
                    }
                }
            }else{
                for(int k=0;k<=j-i;k++){
                    if(k%2==0){
                        ta+=a[k+i];
                    }else{
                        ao+=a[k+i];
                    }
                }
            }
            if(aom<ao){
                aom=ao;
                tam=ta;
            }
        }
        ans=max(ans,tam);
    }
    cout<<ans<<endl;
    return 0;
}

Submission Info

Judge Result