Submission #1779548

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;

#define DEBUG(x) cerr << #x << ": " << x << endl;
#define ll long long

int main() {
    int n;
    cin >> n;
    vector<int> v(n);
    for (int &x : v) cin >> x;

    // 高橋君の最善手を求める
    int Max = -1;
    int tPos = -1;
    for (int i = 0; i < n; i++) { // 高橋君が置く場所
        int sum = 0;
        for (int j = i; j < n; j++) { // 青木君が置く場所
            if (i == j) continue;
            sum += v[j];
        }
            if (sum > Max) {
                Max = sum;
                tPos = i;
            }
    }

    // 青木君の最善手を求める
    // 0 -> tPos
    int aPos = -1;
    Max = -1;
    for (int i = 0; i < tPos-1; i++) {
        int sum = 0;
        for (int j = i; j < tPos; j++) {
            if (i == j) continue;
            sum += v[j];
        }
            if (sum > Max) {
                Max = sum;
                aPos = i;
            }
    }

    // tPos -> end
    for (int i = tPos+1; i < n-1; i++) {
        int sum = 0;
        for (int j = tPos+1; j < n; j++) {
            if (i == j) continue;
            sum += v[j];
        }
            if (sum > Max) {
                Max = sum;
                aPos = i;
            }
    }

    // DEBUG(tPos)
    // DEBUG(aPos)

    int start = min(tPos , aPos);
    int end = max(tPos , aPos);
    int cnt = 1;
    int ans = 0;
    for (int i = start; i <= end; i++) {
        if (cnt & 1) {
            ans += v[i];
        }
        cnt++;
    }

    cout << ans << endl;

    return 0;
}

Submission Info

Judge Result