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 D1D2… DN, where Diis the distance between the i-th and the (i+1)-st exits, and DNis 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.
#include <stdio.h>#include <stdlib.h>#include <algorithm>using namespace std;int main (){int n,i,sum=0;scanf("%d",&n);int *dis=new int[n];int *a=new int[n];a[0]=0;dis[0]=0;for( i=1;i<=n;i++){scanf("%d",a+i);sum+=a[i];dis[i]=sum;}int k,start=0,end=0;scanf("%d",&k);for( i=0;i<k;i++){scanf("%d %d",&start,&end);if( start>end) swap(start,end);int temp=dis[end-1]-dis[start-1];printf("%d\n",min(temp,sum-temp));}system("pause");return 0;}
，我知道我不是一个很好的记录者，但我比任何人都喜欢回首自己来时的路，
