#include <iostream>
#include <algorithm>
#include <vector>
#include <cstdio>
#include <cstring>
using namespace std;
int main()
{
int n;
cin>>n;
int arr[100001];
int count[100002];
int j=1;
count[0]=0;
for(int i=0;i<n;i++)
{
cin>>arr[i];
count[j]=count[j-1]+arr[i];
j++;
}
int m;
cin>>m;
int tmp1,tmp2,a,b;
for(int l=0;l<m;l++)
{
cin>>tmp1>>tmp2;
a=min(tmp1,tmp2);
b=max(tmp1,tmp2);
if(a==1)
printf("%d\n",min(count[b-1],count[n]-count[b-1]));
else
printf("%d\n",min(count[b-1]-count[a-1],count[n]-count[b-1]+count[a-1]));
}
return 0;
}
1046. Shortest Distance (20)
最新推荐文章于 2020-10-03 00:56:16 发布