1046 Shortest Distance (20 分)
#include <iostream>
#include <algorithm>
using namespace std;
const int N = 1011;
int n, m, sum;
int a[N], b[N];
int main(){
scanf("%d", &n);
for (int i = 1; i <= n; i++) {
cin >> a[i];
sum += a[i];
b[i] = sum;
}
scanf("%d", &m);
while (m--){
int x, y;
cin >> x >> y;
if (x > y) swap(x, y);
int temp = b[y-1] - b[x-1];
int res = min(temp, sum - temp);
cout << res << endl;
}
return 0;
}