1046.Shortest Distance (20)

1046.Shortest Distance (20)
时间限制 100 ms 内存限制 65536 kB
代码长度限制 16000 B 判题程序 Standard
作者 CHEN, Yue
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

#include <iostream>
#include <fstream>
using namespace std;

const int MaxN = 100001;

int main()
{
#ifdef _DEBUG
    ifstream cin("data.txt");
#endif // _DEBUG

    int VertexN, TCN, VetA, VetB, RLL, RLR, VMin, VMax, Sum = 0;
    int dis[MaxN], Vertex[MaxN];
    dis[0] = 0;
    cin >> VertexN;
    for (int i = 0; i < VertexN; ++i)
    {
        cin >> Vertex[i];
        Sum += Vertex[i];
        dis[i + 1] = Sum;
    }
    cin >> TCN;
    while (TCN--)
    {
        RLL = RLR = 0;
        cin >> VetA >> VetB;
        VetA > VetB ? (VMin = VetB - 1, VMax = VetA - 1) : (VMin = VetA - 1, VMax = VetB - 1);
        (dis[VMax] - dis[VMin]) > (Sum - dis[VMax] + dis[VMin]) ? (cout << Sum - dis[VMax] + dis[VMin] << endl) : \
            (cout << dis[VMax] - dis[VMin] << endl);
    }

#ifdef _DEBUG
    cin.close();
    system("pause");
#endif // _DEBUG

    return 0;
}