#include<cstdio>
#include<algorithm>
using namespace std;
const int MAXN = 100005;
int dis[MAXN],A[MAXN];
int main()
{
int sum = 0,query,n,left,right;
scanf("%d",&n);
for(int i=0;i<=n;i++)
{
scanf("%d",&A[i]);
sum +=A[i];
dis[i] = sum;
}
scanf("%d",&query);
for(int i=0;i<query;i++)
{
scanf("%d%d",&left,&right);
}
if(left>right)
swap(left,right);
int temp = dis[right-1]-dis[left-1];
printf("%d\n",min(temp,sum-temp));
return 0;
}
PAT A1046
最新推荐文章于 2024-10-03 15:00:00 发布