思路:
输入时计算dis与sum,dis[i]表示 Vi到V1的距离,此时会有dis[N+1]出现,不去理他,1到N的距离不被保存,但无所谓,因为sum-dis[N]即是。计算a、b距离时,dis[a]-dis[b]即可。
注意不能记录各相邻点的距离,来相加临时算a、b的距离,会超时。
#include <cstdio>
int main(){
int n,m;
scanf("%d",&n);
int G[n+1], sum=0, dis[n+1]={0};
for (int i=1;i<=n;i++){
scanf("%d",&G[i]);
sum+=G[i];
dis[i+1] = sum;
}
scanf("%d",&m);
int answer[m] = {0};
for (int i=0;i<m;i++){
int a, b;
scanf("%d%d",&a,&b);
if (a>b){
int t=a;
a=b;
b=t;
}
answer[i] =dis[b]-dis[a];
if (answer[i]>sum-answer[i]){
answer[i] = sum-answer[i];
}
}
for (int i=0; i<m; i++){
printf("%d\n",answer[i]);
}
return 0;
}