1046 Shortest Distance PAT (Advanced Level) Practice

#include <cstdio>
#include <algorithm>
using namespace std;

const int maxn=100010;
int d[maxn],N;

int main(void){
    scanf("%d",&N);
    for(int i=1;i<=N;i++){
        int dis;
        scanf("%d",&dis);
        d[i]=d[i-1]+dis;
    }
    int n;
    scanf("%d",&n);
    for(int i=1;i<=n;i++){
        int v1,v2;
        scanf("%d%d",&v1,&v2);
        if(v1>v2) swap(v1,v2);
        int t=d[v2-1]-d[v1-1];
        printf("%d\n",(t)<(d[N]-t)?t:(d[N]-t));
    }
    return 0;
}