1046. Shortest Distance (20)

题目：https://www.patest.cn/contests/pat-a-practise/1046

#include<cstdio>#include<algorithm>using namespace std;#define MAXN 100010int dis[MAXN]={0},W[MAXN],sum=0,n=0,m=0;int main(){  scanf("%d",&n);  for(int i=1; i<=n; i++)  {    scanf("%d",&W[i]);    dis[i] = dis[i-1] + W[i];    sum = sum + W[i];  }  scanf("%d",&m);  for(int i=0; i<m; i++)  {    int x,y;    scanf("%d%d",&x,&y);    if(x>y)      swap(x,y);    int a = dis[y-1] - dis[x-1];    int b = sum - a;    printf("%d\n",min(a,b));  }  return 0;}