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<string.h>
#include<algorithm>
#include<cstdio>
using namespace std;
int abs(int x)
{
return x>0?x:-x;
}
int dist[100005];
int main()
{
int n;
scanf("%d",&n);
int sum=0;
for(int i=1;i<=n;i++)
{
int a;
scanf("%d",&a);
sum+=a;
dist[i]=dist[i-1]+a;
}
int m;
scanf("%d",&m);
while(m--)
{
int a,b;
scanf("%d %d",&a,&b);
int g=abs(dist[b-1]-dist[a-1]);
int ans=min(g,sum-g);
printf("%d\n",ans);
}
return 0;
}