题目描述
1046 Shortest Distance (20 分)The task is really simple: given N exits on a highway which forms a simple cycle, you are supposed to tell the shortest distance between any pair of exits.
输入格式
Each input file contains one test case. For each case, the first line contains an integer N (in [3,105]), followed by N integer distances D1 D2⋯ DN, where Di is the distance between the i-th and the (i+1)-st exits, and DN is between the N-th and the 1st exits. All the numbers in a line are separated by a space. The second line gives a positive integer M (≤104), with M lines follow, each contains a pair of exit numbers, provided that the exits are numbered from 1 to N. It is guaranteed that the total round trip distance is no more than 107.
输出格式
For each test case, print your results in M lines, each contains the shortest distance between the corresponding given pair of exits.
输入样例
5 1 2 4 14 9
3
1 3
2 5
4 1
输出样例
3
10
7
#include<iostream>
using namespace std;
const int maxn=100010;
int dis[maxn]={0};
int main(){
int N,M,sum=0;
cin>>N;
for(int i=1;i<=N;i++){
cin>>dis[i];//输入到下一个点的距离
sum+=dis[i];
dis[i]=sum;//用来保存距离之和,以便于求后面两点间的距离
}
cin>>M;
while(M--){
int a,b;
cin>>a>>b;
if(a>b)swap(a,b);//因为后面的temp不能是负值
int temp=dis[b-1]-dis[a-1];//temp表示两点间距离
printf("%d\n",min(temp,sum-temp));//求正序和逆序中较小的距离
}
return 0;
}