A1046 Shortest Distance

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 D​1​​ D​2​​ ⋯ D​N​​, where D​i​​ is the distance between the i-th and the (i+1)-st exits, and D​N​​ 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

如果没有经过预处理dis数组和sum的做法会很容易超时。这是因为在极端情况下，每次查询都需要遍历整个数组。 

#include <cstdio>
#include <algorithm>
using namespace std;

const int maxn = 100005;
int dis[maxn], A[maxn];//dis[i]表示1号节点按顺时针方向到达"i号节点顺时针方向的下一个节点的距离"，A[i]存放i号与i + 1号顶点的距离
int main()
{
	int sum = 0, query, n, left, right;
	scanf("%d", &n);
	for(int i = 1; i <= n; i++)
	{
		scanf("%d", &A[i]);
		sum += A[i];
		dis[i] = sum;//预处理dis数组
	}
	scanf("%d", &query);
	for(int i = 0; i < query; i++)
	{
		scanf("%d%d", &left, &right);
		if(left > right)
		{
			swap(left, right);
		}
		int tmp = dis[right - 1] - dis[left - 1];
		printf("%d\n", min(temp, sum - temp));
	}
}

 

普通写法，这样结果正确，但是会超时。

#include <stdio.h>
const int maxn = 100005;
int arr[maxn];
int main(void)
{
	int n;
	scanf("%d", &n);
	int sum = 0;
	for(int i = 1; i <= n; i++)
	{
		scanf("%d", &arr[i]);
		sum += arr[i];
	}

	int num;
	scanf("%d", &num);

	for(int i = 0; i < num; i++)
	{
		int x1, x2;
		int ans1 = 0, ans2 = 0;
		scanf("%d%d", &x1, &x2);

		if(x1 > x2)
		{
			int temp = x1;
			x1 = x2;
			x2 = temp;
		}

		for(int j = x1; j < x2; j++)
		{
			ans1 += arr[j];
		}
		ans2 = sum - ans1;
		if(ans1 > ans2)
		{
			printf("%d", ans2);
		}
		else
		{
			printf("%d", ans1);
		}
		if(i != num - 1)
		{
			printf("\n");
		}
	}
	return 0;
}