PAT A1046 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 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 (<=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

二、题意

单词	意思
exit	出口

n个结点围城一个圈，已知相邻两个结点的距离。现给出m队结点，请求出每队结点之间的最短距离。

三、思路

用dis[i]存储第1个结点到i个结点下一个结点的距离，sum保存整个路径的总和值。两个结点之间的最短距离就是dis[right-1]-dis[left-1]和sum-dis[right-1]-dis[left-1]中较小的那个。

四、注意

如果没有预处理dis数组很容易超时

五、代码

#include <cstdio>
#include <vector>
using namespace std;
int main() {
	int n, m, left, right, temp;
	int sum = 0;
	scanf_s("%d", &n);
	vector<int> dis(n + 1);//是(),不是[]
	for (int i = 1; i <= n; i++) {
		scanf_s("%d", &temp);
		sum += temp;
		dis[i] = sum;
	}
	scanf_s("%d", &m);
	for (int i = 1; i <= m; i++) {
		scanf_s("%d %d", &left, &right);
		if (left > right) swap(left, right);//swap()交换函数
		if ((dis[right - 1] - dis[left - 1]) <= (sum - (dis[right - 1] - dis[left - 1])))
			printf("%d\n", dis[right - 1] - dis[left - 1]);
		else
			printf("%d\n", sum - (dis[right - 1] - dis[left - 1]));
	}
	return 0;
}