1046 Shortest Distance

题目来源：PAT (Advanced Level) Practice

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 D​1​​ D​2​​ ⋯ 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​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

words：

highway 公路        pair 一对        numbered 编号        guaranteed 担保，保证        round 环形的

题意：

给出由n个点构成的环的相邻点之间的距离，求任意两个点之间的距离；

思路：

1. 使用数组a[]存储相邻点之间的距离，a[i]表示 i 与 i+1之间的距离；

2. 使用数组cul[]存储累计距离，cul[i]表示 1 到 i+1 的距离和，cul[i-1]表示 1 到 i 的距离和；

3. 使用total表示所有相邻点距离的和，即整个cycle的长度；

4. 任意两点的距离由两种可能性，一种是顺时针距离d1=cul[a-1]-cul[b-1]（a>b)，另一种是逆时针距离d2=total-d1，选取两者中的最小者即为最短距离；

 

//PAT ad 1046 Shortest Distance
#include <iostream>
using namespace std;


int main()
{
	int n,m;
	cin>>n;
	
	int total=0;		//求所有路段的和，即整个cycle的和 
	int a[n+1]={0};		//存储相邻点的距离，a[i]表示 i与 i+1 的距离 
	int cul[n+1]={0};	//累计距离，cul[i]表示 1 到 i+1 的距离和，cul[i-1]表示 1 到 i 的距离和；	
	for(int i=1;i<=n;i++)
	{
		cin>>a[i];
		total+=a[i];
		cul[i]=a[i]+cul[i-1];
	}
	
	cin>>m;
	while(m--)
	{
		int a,b;
		cin>>a>>b;
		if(a<b)	swap(a,b);
		
		int d1=cul[a-1]-cul[b-1];		//顺时针距离 
		int d2=total-d1;				//逆时针距离 

		cout<<min(d1,d2)<<endl;			//最短距离 
	}

	return 0;
}