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^5]$), followed by N integer distances $D_1{D}_2\cdots 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(\le 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:

5 1 2 4 14 9
3
1 3
2 5
4 1

Sample Output:

3
10
7

题目大意

有$N$条路组成一个环，要求输出环上任意两点之间的最短距离。

思路

循环队列的问题，可以在输入的时候对数据进行处理，统一以1最为起点，a[i]表示1到i的距离，再定义一个计量器，记录环的总距离，计算时要保证起点小于终点，最后比较a[j]-a[i]和sum-(a[j]-a[i])的大小，取小者即可；

代码

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;

const int MAXN = 100001;

int main(){
    int n, m, a[MAXN], sum = 0, t;
    scanf("%d", &n);
    a[1] = 0;
    for(int i=1; i<n; i++){
        scanf("%d", &t);
        a[i+1] = a[i] + t;
        sum += t;
    }
    scanf("%d", &t);
    sum += t;
    scanf("%d", &m);
    for(int i=0; i<m; i++){
        int s, e, temp;
        scanf("%d %d", &s, &e);
        if(s > e)
            swap(s, e);
        temp = a[e] - a[s];
        printf("%d\n", min(temp, sum-temp));
    }
    return 0;
}