1046. Shortest Distance (20)

#include <iostream>
#include <cstdio>
#include <vector>

using namespace std;

int main(){
int n, m;
scanf("%d", &n);

vector<int> cycle(n+1, 0);
int sum = 0;
for(int i = 1; i <= n; ++i){
int d;
scanf("%d", &d);
if(i < n) cycle[i+1] = cycle[i] + d;
sum += d;
}

scanf("%d", &m);
for(int i = 0; i < m; ++i){
int e1,e2;
scanf("%d%d", &e1, &e2);
if(e1 > e2) swap(e1, e2);
int len = cycle[e2] - cycle[e1];
printf("%d\n", min(len, sum-len));
}

return 0;
}