【PAT刷题甲级】1046.Shortest Distance

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 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

题意

输入n条距离，n个点组成一个环，求出给定点对之间的最短距离（只有两条路径，顺时针和逆时针）。
代码思路参照柳神代码（https://blog.csdn.net/liuchuo/article/details/52108507）
自己的思路最后一个点总是运行超时，相加的部分应该在一开始就做好，后面再相加会超时。

代码

#include <iostream>
#include <vector>
using namespace std;
int main() {
	int n,m,a,b,t; 	//路径条数，指定的点对数,点a,点b,路径 
	scanf("%d",&n);
	vector<int> dis(n+1);
	dis[0]=0;
	for(int i=1; i<=n; i++) {
		cin >> t;
		dis[i] = dis[i-1] + t;
	}
	scanf("%d",&m);
	for(int i=0; i<m; i++) {
		int d1=0,d2=0,a0,b0;
		scanf("%d %d",&a,&b);
		a0 = min(a,b),b0 = max(a,b);
		d1 = dis[b0-1] - dis[a0-1];
		d2 = dis[n] - d1;
		printf("%d\n",min(d1,d2));
	}
	return 0;
}