【PAT】A1046.Shortest Distance (20)

Description：
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

//NKW 甲级真题1035
#pragma warning(disable:4996)
#include <stdio.h>
#include <stdlib.h>
#include <algorithm>
using namespace std;
const int maxnum = 100010;
int dis[maxnum];
int sp, ep;
int wlen = 0, len;
int main(){
	int N, m;
	int i;
	scanf("%d", &N);
	dis[0] = 0;
	for (i = 1; i <= N; i++){
		scanf("%d", &dis[i]);
		wlen += dis[i];				//总长度
		dis[i] += dis[i - 1];
	}
	scanf("%d", &m);
	int s, b;
	for (i = 0; i < m; i++){
		len = 0;
		scanf("%d %d", &sp, &ep);
		s = min(sp, ep);
		b = max(sp, ep);
		len = dis[b - 1] - dis[s - 1];
		if (len > wlen - len)
			len = wlen - len;
		printf("%d\n", len);
	}
	system("pause");
	return 0;
}