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
错误思路:每次输入都for循环计算两条路径的长度,会造成超时
错误思路代码如下,好多for循环
#include <cstdio>
#include <cstring>
#include <iostream>
#include <math.h>
using namespace std;
const int n=54;
int main()
{
int n,m,start,end,r1=0,r2=0,min;
scanf("%d",&n);
int dis[n+1];
for(int i=1;i<=n;i++){
scanf("%d",&dis[i]);
}
scanf("%d",&m);
int road[m];
for(int i=0;i<m;i++)
{
scanf("%d %d",&start,&end);
if(start>end){
int temp =end;
end=start;
start=temp;
}
for(int j=start;j<end;j++){
r1+=dis[j];
}
min=r1;
for(int j=end;j<n;j++){
r2+=dis[j];
//cout<<"j是"<<j;
}
for(int j=0;j<start;j++){
if(j==0) r2+=dis[n];
else r2+=dis[j];
}
if(r2<min) min=r2;
road[i]=min;
r1=r2=0;
}
for(int i=0;i<m;i++){
printf("%d",road[i]);
if(i!=m-1) printf("\n");
}
return 0;
}
正确思路:
记录从1到各个点的总长度,用数组dis[]保存,r1=dis[end]-dis[start]可以计算出一条路径的长度。同时在输入路径长度的时候计算整个圈的总长度,r2=总长度-r1,得到第二条路径的长度。比较即可得正确答案。(来自《算法笔记》的思路)
#include <stdio.h>
#include <algorithm>
using namespace std;
const int MAXN = 100005;
int dis[MAXN],a[MAXN];
int main()
{
int n,m,start,end,sum=0;
scanf("%d",&n);
for(int i=1;i<=n;i++){ // 注意i从1开始,方便下文计算
scanf("%d",&a[i]);
sum+=a[i]; // 计算一圈下来的总长度
dis[i]=sum; // 从1到目标点i+1的总距离
}
scanf("%d",&m);
for(int i=0;i<m;i++)
{
scanf("%d%d",&start,&end);
if(start>end){
swap(start,end);
}
int temp = dis[end-1]-dis[start-1]; //注意dis[i]代表的是1到i+1的距离,dis[0]为0
printf("%d\n",min(temp,sum-temp));
}
return 0;
}