题解 | #小美走公路#

#include <any>
#include <bits/stdc++.h>
using namespace std;
using ll=long long ;
int main() {
    ll n,x,y,ans=0;
    cin>>n;
    vector<int>a(n+1);
    for(int i=1;i<=n;i++){
        cin>>a[i];
        ans+=a[i];
    }
    cin>>x>>y;
    ll k=0;
    if(x>y)
    swap(x, y);
    for(int i=x;i<y;i++){
        k+=a[i];
    }
    cout<<min(k,ans-k);
}