题解 | #小美走公路#(cpp)

#include "bits/stdc++.h"

using namespace std;
#define int long long
#define endl "\n"
#define PII pair<int,int>
#define PIII pair<int,PII>
const int MOD = 1e9 + 7;
const int N = 3e5;

void slu() {
    int n;
    cin >> n;
    vector<int> a(n + 1, 0);
    int k;
    for (int i = 2; i <= n; i++)cin >> a[i], a[i] += a[i - 1];
    cin >> k;
    for (int i = 0; i < 1; i++) {
        int l, r;
        cin >> l >> r;
        if (r < l)swap(l, r);
        int shun = a[r] - a[l];
        int ni = (a[n] - a[r]) + a[l] + k;
        cout << min(shun, ni) << endl;
    }
}

signed main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int T;
//    cin >> T;
    T = 1;
    while (T--)slu();

}