題目描述

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.

輸入

Each input file contains one test case. For each case, the first line contains an integer N (in [3, 10⁵]), followed by N integer distances D₁

D₁ … D_N, where Di 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⁴), 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⁷.

輸出

For each test case, print your results in M lines, each contains the shortest distance between the corresponding given pair of exits.

樣例輸入

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

樣例輸出

3
10
7

程式碼：

#include<cstdio>
int main(){
	int N,M,a,b,total=0;//total記錄總距離 
	scanf("%d",&N);
	int exits[N];//存放各段距離 
	for(int i=0;i<N;++i){
		scanf("%d",&exits[i]);
		total+=exits[i];
	}
	scanf("%d",&M);
	for(int i=0;i<M;++i){
		scanf("%d%d",&a,&b);
		int left=a<b?a-1:b-1,right=a>b?a-1:b-1,distance=0;
		for(int i=left;i<right;++i) distance+=exits[i];//a、b區間內的距離 
		distance=distance<total-distance?distance:total-distance;//最小距離 
		printf("%d\n",distance);
	}
	return 0;
}