题解

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

int main() {
    int n;
    cin >> n;

    vector<int> wealth(n);
    for (int i = 0; i < n; i++) {
        cin >> wealth[i];
    }

    int totalWealth = 0;
    for (int i = 0; i < n; i++) {
        totalWealth += wealth[i];
    }

    int Wealth1 = wealth[0];
    int Wealth2 = wealth[n - 1];
    int remainingWealth = totalWealth - Wealth1 - Wealth2;

    if (Wealth1 == Wealth2) {
        totalWealth = remainingWealth;
    }

    int leftIndex = 0;
    int rightIndex = n - 1;

    while (leftIndex < rightIndex) {
        if (Wealth1 == Wealth2) {
            totalWealth = remainingWealth;
            leftIndex++;
            Wealth1 += wealth[leftIndex];
            remainingWealth -= wealth[leftIndex];
        }

        while (leftIndex < rightIndex && Wealth1 < Wealth2) {
            leftIndex++;
            Wealth1 += wealth[leftIndex];
            remainingWealth -= wealth[leftIndex];
        }

        while (leftIndex < rightIndex && Wealth1 > Wealth2) {
            rightIndex--;
            Wealth2 += wealth[rightIndex];
            remainingWealth -= wealth[rightIndex];
        }
    }

    cout << totalWealth << endl;

    return 0;
}

终于，写出来了……（虽然是大循环里嵌俩小循环的劣质代码，但我还是激动到内牛满面）