PAT甲级1046 Shortest Distance

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₅​​ ]), followed by N integer distances D₁​​ D₂​​ ⋯ 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⁴​​ ), 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⁷

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

题目大意

就是给一条循环的路，路上有若干出口，给两个出口a，b，求是从a顺时针到b路径最短还是逆时针更短。

思路

刚开始想复杂了，还想对每个点用单源最短路径的方法求到其他点的最短距离…其实很简单，充分利用循环这一条件。我列一个数组sum，记录从点1到当前点总共的距离，就比如题目给的样例

          1
     9 /      \ 1
      5        2
    14 \      / 2
        4 ——3
          4
数组sum[6] = {0, 1, 3, 7, 21, 30}
1到1是0，到2是1，到3是3，到4是7，到5是21

这样做的好处就是可以直接通过相减得到两个点之间的距离，比如我要求2到3的距离，可以直接用sum[2] - sum[1]（不是sum[3] - sum[2]是因为数组从0开始）。再用一个变量total记录整个环总共的长度，样例中是30。我要求i到j最短的距离，就只要比较sum[j - 1] - sum[i - 1]和total - (sum[j - 1] - sum[i - 1])谁更短即可。
注意：sum[j - 1] - sum[i - 1]要取绝对值，比如样例中最后一个4 1，用sum[0] - sum[3]会出现负数

#include <iostream>
#include <cstdlib>
#include <vector>
#include <cmath>
using namespace std;
int main()
{
	int n, total = 0;
	cin >> n;
	vector<int> sum(n + 1);
	sum[0] = 0;
	for (int i = 1; i <= n; i++)
	{
		int num;
		cin >> num;
		total += num;
		sum[i] = total;
	}
	int k;
	cin >> k;
	for (int i = 0; i < k; i++)
	{
		int b,e;
		cin >> b >> e;
		int short_dis = (abs(sum[e - 1] - sum[b - 1]) < abs(total - abs(sum[e - 1] - sum[b - 1])) ? abs(sum[e - 1] - sum[b - 1]) : abs(total - abs(sum[e - 1] - sum[b - 1])));
		cout << short_dis << endl;
	}
	system("pause");
	return 0;
}