现在一个很大的问题就是容易把问题复杂化,而正解往往又是在原来基础上加以简化得出的。一看就懂,确实最难的,这两天的做题都是如此。注意不要闭门造车。
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
看到一个很好的代码,原样贴下。原帖移步https://www.cnblogs.com/zlrrrr/p/9439663.html
#include<bits/stdc++.h>
using namespace std;
int dis[110000]; //放在main里提交不过
int main(){
int n,m,d,sum=0,c,b;
scanf("%d",&n);
for(int i=0;i<n;i++){
scanf("%d",&d);
sum += d;
dis[i] = sum;
}
scanf("%d",&m);
for(int i=0;i<m;i++){
scanf("%d %d",&c,&b);
if(c>b)swap(c,b);
int tem = dis[b-2]-dis[c-2];
printf("%d\n",min(tem,sum-tem)) ;
}
return 0;
}