1046 Shortest Distance (20)(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, 10^5^]), followed by N integer distances D~1~ D~2~ ... D~N~, where D~i~ 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^.
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
思路:
在输入两两出口的距离的时候,用前缀和来记录,dis[i]表示从出口1到出口i的距离。如果是顺时针出口a到出口b的距离就是abs(dis[a]-dis[b]),如果是逆时针的话就是环的总和减去abs(dis[a]-dis[b])的距离,比较两者的大小即可。
代码:
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
using namespace std;
int dis[100005];
int main()
{
int n, a, b, sum = 0;
cin >> n;
dis[1] = 0;
for (int i = 2; i <= n; i++)
{
cin >> dis[i];
dis[i] += dis[i - 1];
}
cin >> sum;
sum += dis[n];
cin >> n;
for (int i = 0; i < n; i++)
{
cin >> a >> b;
int min = abs(dis[a] - dis[b]);
if (sum - min < min)
min = sum - min;
cout << min << endl;
}
return 0;
}