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,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
这题的思路是把这个环看成一条直线,数组代表到下标i的距离是多少,下标i即为Vi结点的编号,可以简单的求得总的长度,也即一个环的长度,然后求这条线上两者相距的长度,记得把结点i换为结点6,然后再与总长度减去这个距离进行比较,得出一个最小值。
#include<stdio.h>
#include<algorithm>
using namespace std;
int main(){
int N;
scanf("%d",&N);
int sum = 0;
int k = 0;
int a[100050] = {0};
int temp;
for(int i = 2;i <= N + 1;i++){
scanf("%d",&temp);
k += temp;
a[i] = k;
}
int M;
int l,r;
scanf("%d",&M);
for(int i = 1 ; i<= M; i++){
scanf("%d %d",&l,&r);
if(l == 1) l = N + 1;
if(r == 1) r = N + 1;
if(l > r) swap(l,r);
printf("%d\n",min((a[r]- a[l]),k - (a[r]- a[l])));
}
}