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 shortestdistance 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⁵]), followed by N integer distances D₁ D₂ ... 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⁴), 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⁷.

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 <vector>
#include <algorithm>

using namespace std;
/* run this program using the console pauser or add your own getch, system("pause") or input loop */

int N,M;

int main(int argc, char** argv) {
	int i=0;
	
	scanf("%d",&N);
	vector<int> distance(N+1);
	vector<int> sum(N+1,0);
	int total=0;
	for(i=1; i<=N; i++){
		scanf("%d",&distance[i]);
		total+=distance[i];
		sum[i+1]=sum[i]+distance[i];
	}
	scanf("%d",&M);
	while(M--){
		int d1,d2;
		scanf("%d %d",&d1,&d2);
		int tmp=abs(sum[d2]-sum[d1]);
		int res=min(tmp,total-tmp);
		printf("%d\n",res);
	}

	return 0;
}