1046 Shortest Distance

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

int main(){
	int n, n1;
	scanf("%d", &n);
    int dis[n + 1], sum[n + 1];
    sum[0] = 0;
	for(int i = 1; i <= n; i++){
		scanf("%d", &dis[i]);
		sum[i] = dis[i] + sum[i - 1];
	}	
	scanf("%d", &n1);
	int ex1, ex2; 
	for(int i = 1; i <= n1; i++){
		scanf("%d%d", &ex1, &ex2);
		int min1 = 0, min2 = 0;
		if(ex1 == ex2) {
			printf("0\n");
			continue;
		}
		if(ex1 > ex2) swap(ex1, ex2);
		min1 = sum[ex2 - 1] - sum[ex1 - 1];
		min2 = sum[n] - min1;
		printf("%d\n", min(min1, min2));
	}
}