Submission #1833227

---

Source Code Expand

#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>

#define rep(i, m, n) for(int i=int(m);i<int(n);i++)
#define EACH(i, c) for (auto &(i): c)
#define all(c) begin(c),end(c)
#define EXIST(s, e) ((s).find(e)!=(s).end())
#define SORT(c) sort(begin(c),end(c))
#define pb emplace_back
#define MP make_pair
#define SZ(a) int((a).size())

//#define LOCAL 0
//#ifdef LOCAL
//#define DEBUG(s) cout << (s) << endl
//#define dump(x)  cerr << #x << " = " << (x) << endl
//#define BR cout << endl;
//#else
//#define DEBUG(s) do{}while(0)
//#define dump(x) do{}while(0)
//#define BR
//#endif


//改造
typedef long long int ll;
using namespace std;
#define INF (1 << 20)
#define INFl (ll)5e15
#define DEBUG 0 //デバッグする時1にしてね

//ここから編集する
int N;
vector<int> a;

int highScore(int l,int r){
    if(l > r) swap(l,r);
    int sum = 0;
    for(int i = 0; l + i <= r; i++){
        if(i % 2 == 0) sum += a[i+l];
    }
    return sum;
}

int blueScore(int l,int r){
    if(l > r) swap(l,r);
    int sum = 0;
    for(int i = 0; l + i <= r; i++){
        if(i % 2 != 0) sum += a[i+l];
    }
    return sum;
}


int main() {
    cin >> N;
    rep(i,0,N){
        int tmp;
        cin >> tmp;
        a.push_back(tmp);
    }

    int ans = -114514;
    rep(i,0,N){
        int max_a = -114514;//aoki's Score
        int max_k = -114514;
        rep(j,0,N){
            if(i != j){
                if(blueScore(i,j) > max_a){
                    max_a =blueScore(i,j);
                    max_k = j;
                }
            }
        }
//        if(ans < highScore(i,max_k)){
//            cout << i << endl;
//        }
        ans = max(highScore(i,max_k),ans);

    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result