#include <iostream>
#include <cstring>
using namespace std;
int a[100005];
int b[100005];
int main()
{
memset(a, 0, sizeof(a));
memset(b, 0, sizeof(b));
int n;
cin >> n;
int sum =0;
for (int i = 0; i < n; i++)
{
cin >> a[i];
b[i] = sum;
sum += a[i];
}
int m;
cin >> m;
while (m--)
{
int x, y;
cin >> x >> y;
int min = 0;
if (x > y)
swap(x, y);
min = b[y-1]-b[x-1];
if (min > sum-min)
min = sum-min;
cout << min << endl;
}
}
PAT甲级 1046 Shortest Distance
最新推荐文章于 2024-02-22 17:36:12 发布