1046 Shortest Distance
分数 20
作者 CHEN, Yue
单位 浙江大学
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
* 考察前缀和;
* s[i] 表示 是起点1到第i点的距离;
*
* 求l到r的最短距离:
* l到r的距离为 d = s[r] - s[l], 求最短距离就是求 min(d, s[n+1] - d) 的值;
*
* 注意,当输入的 l > r 的时候,交换两个数的值,以便统一处理;
/**
* 考察前缀和;
* s[i] 表示 是起点1到第i点的距离;
*
* 求l到r的最短距离:
* l到r的距离为 d = s[r] - s[l], 求最短距离就是求 min(d, s[n+1] - d) 的值;
*
* 注意,当输入的 l > r 的时候,交换两个数的值,以便统一处理;
*/
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
typedef long long LL;
const int N = 1e5 + 10;
LL s[N];
int main()
{
int n;
cin >> n;
int sum = 0;
for(int i=2; i<=n+1; ++i) //注意i是从2开始的,因为第一个数据是1到2的距离
{
int d;
cin >> d;
s[i] = s[i-1] + d;
}
int m;
cin >> m;
while (m -- )
{
int l, r;
cin >> l >> r;
if(l > r)
swap(l ,r);
LL d = s[r] - s[l];
cout << min(d, s[n+1] - d) << endl;
}
return 0;
}