题目:
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 1
Sample Output:
3
10
7
思路1:按照相隔点数少的计算距离,再用total_round减去它,取较小者作为最短距离。3号测试点运行超时
思路2:读取输入时,存储每个点顺时针到点1的距离,两点到点1的距离差便是两点之间顺时针的距离,再计算两点之间逆时针的距离,取其较小者。
思路1代码:
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int dis[n];
int total_round = 0;
for(int i=0; i<n; i++)
{
cin >> dis[i];
total_round += dis[i];
}
int m;
cin >> m;
for(int i=0; i<m; i++)
{
int p, q;
cin >> p >> q;
if(p>q)
{
int temp = p;
p = q;
q = temp;
}
if(p-q > n/2)
{
int temp = p;
p = q;
q = temp;
}
int long_dis =0;
for(; p%n!=q; p++)
long_dis += dis[(p-1)%n];
long_dis = (total_round - long_dis) > long_dis ? long_dis :total_round-long_dis;
cout << long_dis << endl;
}
return 0;
}
思路2代码:
#include<iostream>
using namespace std;
int main()
{
int n;
cin >> n;
int dis[n];
int shun_dis[n]; shun_dis[0] = 0;
int total_round = 0;
for(int i=0; i<n; i++)
{
cin >> dis[i];
total_round += dis[i];
if(i>0)
shun_dis[i] = shun_dis[i-1] + dis[i-1];
}
int m;
cin >> m;
for(int i=0; i<m; i++)
{
int p, q;
cin >> p >> q;
p--; q--;
if(p>q)
{
int temp = p;
p = q;
q = temp;
}
int long_dis = shun_dis[q] - shun_dis[p];
long_dis = (total_round - long_dis) > long_dis ? long_dis :total_round-long_dis;
cout << long_dis << endl;
}
return 0;
}