思路:注意数组一定要初始化(为0),否则会随机初始化成一个非常大的数
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 11000;
int main() {
int A[maxn] = { 0 }, n, m, sum = 0, dis[maxn] = {0}, s, e;
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> A[i];
sum += A[i];
dis[i]=sum;
}
cin >> m;
for (int i = 0; i < m; i++) {
cin >> s >> e;
if (s > e)
swap(s, e);
int temp = min(dis[e - 1] - dis[s - 1], sum - (dis[e - 1] - dis[s - 1]));
cout << temp << endl;
}
system("pause");
return 0;
}