Submission #1516283

---

Source Code Expand

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility>

using namespace std;
using llng = long long;
template<typename T> using v = vector<T>;
template<typename T> using vv = v<v<T> >;

int main() {
    int N; cin >> N;
    v<int> in(N+1, 0), o(N+1, 0), e(N+1, 0);
    for (int i=1; i<=N; i++) {
        cin >> in[i];
        o[i] = o[i-1]; e[i] = e[i-1];
        if (i % 2 == 1) o[i] += in[i];
        else e[i] += in[i];
    }

    int ans = -10000;
    for (int t=1; t<=N; t++) {
        int maxap = -10000, savetp, ap, tp;
        for (int a=1; a<=N; a++) if (a != t) {
            int l = min(a, t), h = max(a, t);
            if (l % 2 == 1) { tp = o[h] - o[l-1]; ap = e[h] - e[l-1]; }
            else { tp = e[h] - e[l-1]; ap = o[h] - o[l-1]; }
            if (ap > maxap) {
                maxap = ap;
                savetp = tp;
            }
        }
        ans = max(ans, savetp);
    }
    cout << ans << endl;
    return 0;
}

Submission Info

Judge Result