PAT（甲级）Shortest Distance (20)

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

代码：

#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<algorithm>
using namespace std;
int main()
{ 
	int dis[100005]={0},total[100005]={0};
	int i,n,m,sum=0,a,b;
	scanf("%d",&n);
	for(i=0;i<n;i++)
	{
		scanf("%d",&dis[i]);
		sum+=dis[i];
		if(i == 0)  
                total[i+1]=dis[i];  
            else  
                total[i+1]= total[i]+dis[i];  
	}
	scanf("%d",&m);
	for(i=1;i<=m;i++){
	    scanf("%d%d",&a,&b);
		if(a>b) swap(a,b);
	    int t=total[b-1]-total[a-1];
		printf("%d\n",min(t,sum-t));
	}
	system("pause");
}