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,10^5 ]), followed by N integer distances D1 D2 ⋯ DN , where Di is the distancebetweenthe 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 (≤10’4 ), 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 10^7
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、如果录入数据完后,再用循环逐个相加,则测试点2会超时的,应该在录入时打一个表,最后相减得距离差;而这是个环,两个点就两条路可到达,还是互补的,则环的总距离减一条路得另条路距离,一比较就出来了
2、刚开始一看求最短距离,脑袋一阵兴奋,图立马安排上,显然最后一个测试点内存不够,最后才反应过来这不一共就两条路吗,还是连续的,一个数组就搞定了嘛
我的代码:
#include<cstdio>
const int maxn = 100010;
int main()
{
int n,m,d,dis[maxn],sum = 0;
scanf("%d",&n);
for (int i = 1 ;i <= n ;i++)
{
scanf("%d",&d);
dis[i] = sum;
sum += d;
}
scanf("%d",&m);
for (int i = 0 ;i < m ;i++)
{
int v1,v2;
scanf("%d%d",&v1,&v2);
int diff = (v1 < v2)?dis[v2] - dis[v1]:dis[v1] - dis[v2];
printf("%d\n",(sum - diff < diff)?sum - diff:diff);
}
return 0;
}