codeup 6116 问题 E: Shortest Distance mw的解题思路与优化方案

题目

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 $D_1$ $D_2$ … $D_N$, where Di 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^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$.

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

解题思路

第一次做英文题目还是挺胆怯的，但是仔细看过题目之后发现并不是很难，其实就是一个简单地最短路径问题，题目会在第一个数给出有几个点，再依次把这几个点之间的距离写出来，之后会给出几组数字，让你找出各组数字间的最短距离。

我们先把不同含义的数存到不同的变量或数组中，这里不再展开赘述，重点是距离判定问题，其实通过思考可以得知其实就两种路径方案，一种正着来，一种反着来。我们只要把这两种方案的距离算出来进行比较就可知最短路径是哪一条了。

先把全部距离加起来，再进行一个循环，当这个循环进行到题目要求的两个点之间的话，正着来的距离就是相加，反着来的距离就是用总距离减去这一段的距离，最后比较进行输出。
记得保证输入的节点数1小于节点数2。

总体代码

#include<stdio.h>
int num[100000];
int main(){
	int n,m;
	int sum=0;
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&num[i]);
//		printf("%d\n",num[i]);
		sum+=num[i];
	}
//	printf("%d",sum);
	scanf("%d",&m);
	for(int j=0;j<m;j++){
		int x,y;
		int s=sum;
		int ans1=0,ans2=0;
		scanf("%d%d",&x,&y);
		if(x>y){
			int temp=x;
			x=y;
			y=temp;
		}
		for(int i=1;i<=n;i++){
			if(i>=x&&i<y){
				ans1+=num[i];
				s=s-num[i];
			}
		}
		ans2=s;
		if(ans1>ans2){
			printf("%d\n",ans2);
		}
		else printf("%d\n",ans1);
	}
	return 0;
}

谢谢观看！