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.
Input Specification:
Each input file contains one test case. For each case, the first line contains an integer N (in [3,10
5]), 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 (≤10^4), 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 10^7
.
Output Specification:
For each test case, print your results in M lines, each contains the shortest distance between the corresponding given pair of exits.
Sample Input:
5 1 2 4 14 9
3
1 3
2 5
4 1
Sample Output:
3
10
7
思想:
在输入过程中用sum来求整个序列的长度,再用一个x[]数组来保存从1节点到某一i节点的距离。
求的过程中就无需对整个序列进行遍历,只需要用到1节点距离的差和sum减去此差来表示两种路径。
代码:
#include <bits/stdc++.h>
using namespace std;
int main(){
int n,d[100005];
int k,a,b;
int sum=0,x[100005];
cin>>n;
for(int i=1;i<=n;i++){
scanf("%d",&d[i]);
x[i]=sum;
sum+=d[i];
}
//x[i]是1到i的距离
cin>>k;
while(k--){
cin>>a>>b;
cout<<min(x[max(a,b)]-x[min(a,b)],sum-(x[max(a,b)]-x[min(a,b)]))<<endl;
}
return 0;
}