#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
int n, m, x, a, b, k;
scanf("%d", &n);
int dist[n+2] = {0}; //dist[n + 1]表示前n个站点路径和
for(int i = 1; i <= n; i++){
scanf("%d", &x);
dist[i + 1] = x + dist[i];
}
scanf("%d", &m);
while(m--){
scanf("%d%d", &a, &b);
if(a > b) swap(a, b);
k = dist[b] - dist[a];
printf("%d\n", min(k, dist[n + 1] - k));
}
return 0;
}
1046 Shortest Distance (20分)
最新推荐文章于 2024-08-13 14:56:59 发布