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

代码

#include<iostream>
using namespace std;
int main()
{
	int n;
	scanf("%d",&n);
	int a[n+1];
	int lj[n+1] = {0};
	int sum = 0;
	for(int i = 1;i <= n;i++)
	{
		scanf("%d",&a[i]);
		lj[i] = a[i]+lj[i-1];
		sum = sum + a[i];
	}
	int m;
	scanf("%d",&m);
	for(int i = 1;i <= m;i++)
	{
		int d1,d2;
		scanf("%d %d",&d1,&d2);
		if(d1 > d2)
			swap(d1,d2);
		int a = lj[d2-1]-lj[d1-1];
		int b = sum - a;
		printf("%d\n",min(a,b));
	}
}