PAT：A1046 Shortest Distance （20 分）

PAT：A1046 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​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

代码：

C/C++:

#include <cstdio>
#include <algorithm>
using namespace std;

const int MAXN = 100005;
int dis[MAXN], A[MAXN];
int main() {
    int sum = 0, query, n, left, right;
    scanf("%d", &n);
    for(int i = 1; i <= n; i++) {
        scanf("%d", &A[i]);
        sum += A[i];
        dis[i] = sum;
    }
    scanf("%d", &query);
    for(int i = 0; i < query; i++) {
        scanf("%d%d", &left, &right);
        if(left > right) swap(left, right);
        int temp = dis[right - 1] - dis[left - 1];
        printf("%d\n", min(temp, sum - temp));
    }
    return 0;
}

Java：

import java.util.Scanner;

/**
 * 一个运行超时，建议使用C/C++
 */
public class Main{

    static int maxn = 100010;
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int away[] = new int[maxn];
        int a[] = new int[maxn];
        int n, m, sum = 0, left, right;
        n = in.nextInt();
        for(int i = 1; i <= n; i++) {
            a[i] = in.nextInt();
            sum += a[i];
            away[i] = sum;
        }
        m = in.nextInt();
        for(int i = 0; i < m; i++) {
            left = in.nextInt();
            right = in.nextInt();
            if(left > right) {
                int temo = left;
                left = right;
                right = temo;
            }
            int x = away[right - 1] - away[left - 1];
            int y = sum - x;
            System.out.printf("%d\n", x < y ? x : y);
        }
        in.close();
    }

}