题目描述
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.
输入
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.
输出
For each test case, print your results in M lines, each contains the shortest distance between the corresponding given pair of exits.
样例输入
5 1 2 4 14 9
3
1 3
2 5
4 1
样例输出
3
10
7
反思:从2走到5和从5走到2的距离是一样的,把一圈的总距离记下来,再随便走一下,比较,求出最小值。
#include <iostream>
using namespace std;
const int maxn=100010;
int dis[maxn];
int main()
{
int n,sum=0;
scanf("%d",&n);
for(int i=0;i<n;i++)
{
scanf("%d",&dis[i]);
sum=sum+dis[i];//一圈的总距离sum
}
//printf("%d\n",sum);
int m,head,tail,sum1,temp;
scanf("%d",&m);
for(int j=0;j<m;j++)
{
sum1=0;
scanf("%d %d",&head,&tail);
if(head>tail)//如果头比尾大的话就反着走,反正最后都要比较的
{
temp=head;
head=tail;
tail=temp;
}
for(int k=head-1;k<tail-1;k++)
{
sum1=sum1+dis[k];
//printf("%d\n",dis[k]);
}
if(sum1<(sum-sum1))//比较正着走和反着走
printf("%d\n",sum1);
else
printf("%d\n",sum-sum1);
}
return 0;
}