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,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.
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
题意为求环上两个结点之间的最小距离。
参考代码:
#include <cstdio>
#include <cmath>
#include <algorithm>
using namespace std;
int d[100010];//输入的数据
int mp[100010];//第1个结点到顺时针第i个结点的距离
int main()
{
int n,m;
while(scanf("%d",&n)!=EOF)
{
int sum=0; //利用sum记录总距离
for(int i=1;i<=n;++i)
{
scanf("%d",&d[i]);
sum+=d[i];
mp[i]=sum;
}
scanf("%d",&m);
int a,b;
for(int i=1;i<=m;++i)
{
scanf("%d%d",&a,&b);
if(a>b)
swap(a,b);
int temp=mp[b-1]-mp[a-1];//注意此处的距离
printf("%d\n",min(temp,sum-temp)); //因为是环,故答案可能是从反方向走的最小距离
}
}
return 0;
}