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

要求 环形求其中两点A, B之间最短长度.
1. 累加 (超时)
2. |dis(A) - dis(B)| dis()为点到0的距离

路径有两个, [B-A]和[B-0-A], 所以在代码中需要比较大小.

#include<iostream>  
#include<vector>

using namespace std;

int main()
{
    int N, M;
    int sum = 0;
    vector<int> vec;
    cin >> N;
    for (int i = 0; i < N; ++i) {
        int temp;
        cin >> temp;
        vec.push_back(sum);
        sum += temp;
    }
    cin >> M;
    for (int i = 0; i < M; ++i) {
        int a, b;
        cin >> a >> b;
        int result = abs(vec[a - 1] - vec[b - 1]);
        if (sum - result > result)
            cout << result << endl;
        else
            cout << sum - result << endl;
    }
    return 0;
}