100000575 - 《算法笔记》3.1小节——问题 E: Shortest Distance (20)

最新推荐文章于 2023-05-05 10:29:13 发布

gentlebreeze_zs

最新推荐文章于 2023-05-05 10:29:13 发布

阅读量71

点赞数 1

本文链接：https://blog.csdn.net/qq_41844076/article/details/112797032

版权

题目描述：
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, 105]), 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 (<=104), 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
2 5
4 1

样例输出：

3
10
7

代码：

#include <iostream>
#include <cstring>
using namespace std;
const int N=1e5+5;
int a[N];
int main(){
	#ifdef ONLINE_JUDGE
	#else
		freopen("in.txt","r",stdin);
	#endif
	int n,count,sum=0,distance[N],headp,rearp,distval;//数组a[i]表示结点i到结点i+1的距离 
	scanf("%d",&n);
	for(int i=1;i<=n;i++){
		scanf("%d",&a[i]);
		sum+=a[i];
		distance[i+1]=sum;
	}
	scanf("%d",&count);
	for(int i=1;i<=count;i++){
		scanf("%d%d",&headp,&rearp);
		if(headp>rearp) swap(headp,rearp);
		distval=distance[rearp]-distance[headp];
		printf("%d\n",min(distval,sum-distval));
	}	 
	return 0;
}