PAT甲级A1046 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.
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
题目理解:
一道简单的模拟题,只需要在输入的时候记录每一个点到起点(1号点)的距离,每次查询都将两个查询点a/b与起点的距离作差就可以得到d。因为各点之间构成一个环,为了取到最短距离应该取min(sum-d,d)。
AC代码:
#include <bits/stdc++.h>
using namespace std;
const int maxn=100002;
int n,k,a,b,dis[maxn];
int main()
{
cin>>n;
for(int i=2;i<=n+1;i++)
{
cin>>dis[i];
dis[i]+=dis[i-1]; //dis[i]表示i-th点到1st的距离
}
cin>>k;
while(k--)
{
cin>>a>>b;
if(a<b) swap(a,b);
printf("%d\n",min(dis[n+1]-(dis[a]-dis[b]),dis[a]-dis[b])); //dis[n+1]存储的是整个环路的总里程
}
return 0;
}