1046 Shortest Distance (20)（20 point(s)（cj)

1046 Shortest Distance (20)（20 point(s)）

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

code

#include <iostream>
#include <cmath>
int arr[100005];
using namespace std;
int main(){
	int n;
	cin >> n;
	int sum = 0, x, y;
	for (int i = 1; i <= n; ++i) {
		cin >> x;
		sum += x;
		arr[i] = sum;
	}
	int m;
	cin >> m;
	for (int i = 0; i < m; ++i) {
		cin >> x >> y;
		int res = abs( arr[y-1] - arr[x-1] );
		int res2 = sum - res;
		if (res < res2) cout << res << endl;
		else cout << res2 << endl;
	}
	system("pause");
	return 0;
}