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
- 这题十分容易超时!解决超时的办法就是检验代码里面有没有一直重复的去做一件事情。这题一直重复的点就是,不断的计算两点之间的距离,其实可以提前把距离算好,用的时候求差就可以了 。
#include<cstdio>
#include<algorithm>
using namespace std;
int main()
{
int N;
scanf("%d", &N);
int dist[100010] = {0}, sum = 0, length;
for(int i = 1; i <= N; i++)
{
scanf("%d", &length);
sum += length;
dist[i] = sum;
}
int M;
scanf("%d", &M);
int arr[10010], x, y;
for(int j = 1; j <= M; j++)
{
scanf("%d%d", &x, &y);
if(x > y)
{
int tmp = x;
x = y;
y = tmp;
}
int s = dist[y - 1] - dist[x - 1];//常见的错误就是用for循环计算x到y的和,这一步工作重复了,需要直接预处理,不然会超时。
printf("%d\n", min(s, sum - s));
}
return 0;
}