算法笔记习题：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.

输入

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

输出

For each test case, print your results in M lines, each contains the shortest distance between the corresponding given pair of exits.

案例

5 1 2 4 14 9
3
1 3
3
2 5
10
4 1
7

题目解析

• N个结点围成一个圈，求任意两个点之间的最短距离。
• N表示有N个点，然后输入D1，D2……DN,例如Di就表示第i个点到第i+1个点的距离，DN存放的是第N个点到第一个点的距离；
• 然后输入M[≤10^4]，表示接下来有M组数据，求每组数据的最短距离

代码

#include <stdio.h>

int main(){
	int n,m;
	int a,b;

	// 数组大小要写对
	int d[100000];
	
	// 两个结点有两条路径，r1表示普通路径（例如：1->2->3），r2表示特殊路径(例如：3->4->1)
	int r1 = 0,r2 = 0;
	
	while(scanf("%d",&n) != EOF){
		
		for(int i =0;i<n;i++){
			scanf("%d",&d[i]);
		}
		
		scanf("%d",&m);
		for(int i=0;i<m;i++){
			scanf("%d %d",&a,&b);
			
			//如果前面一个比较大，记得换个顺序
			if(a > b){
				int tmp = a;
				a = b;
				b = tmp;
			}
			
			for(int k=a-1;k<b-1;k++){
				r1 = r1 + d[k];
			}
			
			// 特殊路径要分成两段来求解
			for(int k=b-1;k<n;k++){
				r2 = r2 + d[k];
			}
			for(int k = 0;k<a-1;k++){
				r2 = r2 + d[k];
			}
			
			if(r1 > r2){
			printf("%d\n",r2);
			}else{
			printf("%d\n",r1);
		}
		
		// 重置数据
		r1 = 0,r2 = 0;
		
		}
	}
	return 0;
}