PAT甲级 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,10⁵]), followed by N integer distances D₁ D₂ ⋯ 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⁴), 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⁷.

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

此题是一个模拟题，博主采用的是子列和的思想实现，由于std的命名空间有重名distance变量，故使用std::这样的方式

#include <iostream>
#include <algorithm>

const int N = 100005;
int total_distance[N], distance[N];

int main() {
    int n, m, sum = 0;
    std::cin >> n;
    for (int i = 1; i <= n; ++i) {
        std::cin >> distance[i];
        sum += distance[i];
        total_distance[i] = sum;
    }
    std::cin >> m;
    while (m--) {
        int a, b;
        int distance1, distance2;
        std::cin >> a >> b;
        if (a > b)
            std::swap(a, b);
        distance2 = total_distance[b-1] - total_distance[a-1];
        distance1 = sum - distance2;
        if (distance1 < distance2)
            std::cout << distance1 << std::endl;
        else
            std::cout << distance2 << std::endl;
    }
    return 0;
}