1046 Shortest Distance (20 分)

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​​ ⋯ 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

#include<bits/stdc++.h>
using namespace std;

int main() {
	int N;
	scanf("%d", &N);
	int num[N + 1];
    long long total = 0, ha[100005];
	for (int i = 1; i <= N; i++) {
		scanf("%d", &num[i]);
        total += num[i];
        if (i == 1) ha[2] = num[i];
        else ha[i + 1] = ha[i] + num[i];
	} 
	int K, a, b, mins, maxs;
	scanf("%d", &K);
	for (int i = 0; i < K; i++) {
		scanf("%d%d", &a, &b);
		if (a < b) {
			mins = a;
			maxs = b;
		} else {
			mins = b;
			maxs = a;
		}
		long long temp1 = 0, temp2 = 0;
		temp1 = ha[maxs] - ha[mins];
		temp2 = total - temp1;
		if (temp1 < temp2) printf("%d\n", temp1);
		else printf("%d\n", temp2);
	}
	
	return 0;
}