PAT 甲级 1046  Shortest Distance

1046 Shortest Distance （20 point(s)）

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

经验总结：

这一题，大概不能根据查询的点再进行计算，而是在输入的时候就进行累加，查询时，直接根据sum数组相减就可以直接得到两个出口之间的距离，然后比较两种情况（毕竟是一个圈，A和B之间可以从A到B，也可以从B到A，顺时针或者逆时针。），取最小者即可。

AC代码

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn=100010;
int sum[maxn]={0},ex[maxn];

int main()
{
	int n,m,a,b;
	scanf("%d",&n);
	sum[0]=0;
	for(int i=0;i<n;++i)
	{
		scanf("%d",&ex[i]);
		sum[i+1]=sum[i]+ex[i];
	}
	scanf("%d",&m);
	for(int i=0;i<m;++i)
	{
		scanf("%d %d",&a,&b);
		if(a>b)
			swap(a,b);
		int d1=sum[b-1]-sum[a-1];
		int d2=sum[a-1]-sum[0]+sum[n]-sum[b-1];
		printf("%d\n",d1<d2?d1:d2);
	}
	return 0;
}