PAT (Advanced Level) 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.

Input Specification:

Each input file contains one test case. For each case, the first line contains an integer N (in [3, 10⁵]), followed by N integer distances D₁ D₂ ... D_N, where D_i is the distance between the i-th and the (i+1)-st exits, and D_N 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⁴), 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⁷.

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

为了达到O(N)，输入时进行累加记录原道到每个点的单向距离，同时算出整个环的长度sum。

求点a和点b (a<b) 的距离，可以用原点到b的距离减去原点到a的距离得到单向距离len。由于有两个方向，需要输出len和sum-len较小的一个。

/*2015.7.26cyq*/
#include <iostream>
#include <vector>
#include <math.h>
using namespace std;

int main(){
	int N;
	cin>>N;
	vector<int> ivec;
	int sum=0;
	int x;
	for(int i=0;i<N;i++){
		ivec.push_back(sum);//第一个点到原点距离为0
		cin>>x;
		sum+=x;
	}
	int M;
	cin>>M;
	int a,b;
	while(M--){
		cin>>a>>b;
		a--;
		b--;
		if(a>b)
			swap(a,b);
		int len=ivec[b]-ivec[a];
		len=min(len,sum-len);
		cout<<len<<endl;
	}
	return 0;
}