题解 | 小美走公路

#include <iostream>
using namespace std;

const int N = 1e5 + 10;

long long n, a[N];

int main()
{
    cin >> n;
    for (int i = 1; i <= n; i ++ ) cin >> a[i], a[i] += a[i - 1];
    int x, y;
    cin >> x >> y;
    long long ans = 0;
    if (x > y) swap(x, y);
    ans = a[y - 1] - a[x - 1];
    ans = min(ans, (long long)a[n] - ans);
    cout << ans << "\n";
    return 0;
}