1046 Shortest Distance (20 分)-PAT甲级

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,105]), 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 (≤104), 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 107.

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

 题目大意：求一环形高速公路给定顶点间的最短距离。

 思路：1.这题的本质还是求给定区间的元素和，而且是一次输入，多次查询的类型，可以想到数组前缀和，与普通直线数组不同，这个数组可以理解为环形数组，即数组总长一定，两个顶点之间的路线有两条，即为以两顶点为分隔的外围曲线，设这两条路径曲线的长度分别为

s1,s2,这个环的总长为s，则有s1+s2=s,由此性质可知，如果其中一条小于或等于s/2,那这条就是这两个顶点间的最短距离，如果其中一条大于s/2，那么另一条就是就是这两个顶点间的最短距离。 

2.采用sum数组来保存前缀和，置sum[0]=0,sum[i]表示为顺时针方向第1个顶点到第i+1个顶点的距离，那么m,n之间的距离（m<n）可表示为sum[n-1]-sum[m-1]

 AC代码

#include <iostream> 
using namespace std;
int sum[1000001] = {0};
int main() {
	int n;  
	scanf("%d", &n);
	for (int i = 1; i <= n; i++) {
		int temp;
		scanf("%d", &temp);
		sum[i] = sum[i - 1] + temp;
	}
	int m;
	scanf("%d", &m);
	while (m--) {
		int start, end;
		scanf("%d%d", &start, &end);
		if (start > end) {
			swap(start, end);
		}
		if (sum[end - 1] - sum[start - 1] <= sum[n] / 2) {
			printf("%d\n", sum[end - 1] - sum[start - 1]);
		} else {
			printf("%d\n", sum[n] - sum[end - 1] + sum[start - 1]); 
		}
	}
	return 0;
}

  更多PAT甲级题目：请访问PAT甲级刷题之路--题目索引+知识点分析（正在进行），感谢支持！