题目
题目描述
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.
理解
计算一个环路上的两个节点,顺逆时针两个方向哪边路径更短。
思路
在输入时可以用sum变量更新总长度,这样后边计算可以只计算单侧长度,然后用sum做减法,更加方便。千万别忘了每次输出要换行!!!
代码
#include<iostream>
using namespace std;
int main()
{
int n=0;
cin>>n;
int sum=0;
int *a=new int[n];
for(int i=0; i<n; i++)
{
cin>>a[i];
sum+=a[i];
}
int k=0;
cin>>k;
for(int i=0; i<k; i++)
{
int p,q;
cin>>p;
cin>>q;
p-=1;
q-=1;
if(p>q)
{
int temp=q;
q=p;
p=temp;
}
int r1=0,r2=0;
for(int j=p; j<q; j++)
{
r1+=a[j];
}
r2=sum-r1;
//不要忘记输出换行!!!!!
(r1<r2)?cout<<r1<<endl:cout<<r2<<endl;
}
return 0;
}