PAT Advanced 1046 Shortest Distance

1046 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,105]), followed by N integer distances D1 D2 ⋯ 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 (≤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

解题大意

给定 m 个数字 ， 围成一个环， 给定n个数（询问的次数）， 在n次讯问中找到起点到终点的最小距离。

解题思路

在每一次询问中，找到起点到终点的最小距离，根据环的性质，此时存在两种方案为顺时针和逆时针遍历，并且他们是互补(以路径总和)的，其中只需要求一个方向即可，通过前缀和数组的形式保存（到终点的距离 - 到起点的距离 ，求出两点之间距离），在两个方向找到最小值即可。

解题代码

#include <cstdio>
#include <algorithm>
using namespace std;
const int N = 100010;
int n, m, v[N];
int main(){
    scanf("%d", &m);
    for (int i = 1; i <= m; i++) {
        scanf("%d", &v[i]);
        v[i] += v[i - 1];
    }
    scanf("%d", &n);
    while(n --){
        int st, ed, t;
        scanf("%d %d", &st, &ed);
        t = abs(v[ed - 1]- v[st - 1]);
        printf("%d\n", min(t, v[m] - t));
    }
    return 0;
}