1046 Shortest Distance （20 point(s)）

#include<iostream>
#include<cstdio>
#include<algorithm> 
using namespace std;
const int MAXN = 1e5 + 10;
int sum[MAXN];
int n, x;
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; ++i) scanf("%d", &sum[i]), sum[i] = sum[i - 1] + sum[i];
	int m, x, y;
	scanf("%d", &m);
	for(int i = 0; i < m; ++i) {
		scanf("%d%d", &x, &y); 
		if(x > y) swap(x, y); // x <= y
		printf("%d\n", min(sum[y - 1] - sum[x - 1], sum[n] - sum[y - 1] + sum[x - 1]));
	}
	return 0;
}