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 1Sample Output:
3 10 7
#include<iostream> #include<vector> #include<stdio.h> #include<algorithm> #include<math.h> #include<map> using namespace std; int main() { int n,temp,start,end,sum=0; vector<int>exits_distance; scanf("%d",&n); vector<int>distance(n,0); for(int i=0;i<n;++i){ scanf("%d",&temp); exits_distance.push_back(temp); if(i==0) distance[i]=0; else distance[i]=distance[i-1]+exits_distance[i-1]; sum+=temp; } scanf("%d",&n); while(n--){ int left=0,right=0; scanf("%d %d",&start,&end); if(start>end) swap(start,end); right =distance[end-1]-distance[start-1]; left = sum-right; printf("%d\n",left<right?left:right); } return 0; }