问题 E: Shortest Distance (20)

题目链接
代码中附有注释：

//超时了，没考虑最坏情况10^9的时间复杂度
#pragma warning(disable:4996);
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[100005];
int main()
{
		int n;
		scanf("%d", &n);
		for (int i = 0;i < n;i++)
		{
			scanf("%d", &a[i]);
		}
		int m;
		scanf("%d", &m);
		for (int i = 0;i < m;i++)
		{
			int x, y;
			scanf("%d%d", &x, &y);
			if (x > y) {
				int t = y;
				y = x;
				x = t;
			}//避免考虑大小问题
			int dis = 0;
			int dis1 = 0;
			int dis2 = 0;
			//分别以顺逆时针方向前行，看怎么样走所得距离最短
			for (int j = x - 1;j <= y - 2;j++)
				dis1 += a[j];
			for (int j = y - 1;j < n;j++)
				dis2 += a[j];
			for (int j = 0;j <= x - 2;j++)
				dis2 += a[j];
			if (dis1 > dis2) dis = dis2;
			else dis = dis1;
			printf("%d\n", dis);
		
	}
	return 0;
}

AC:

#pragma warning(disable:4996);
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<iostream>
#include<algorithm>
using namespace std;
int a[100005],dis[100005];//dis[i]表示1号节点按顺时针方向到达i节点下一个节点的距离
int main()
{
	int n;
	cin >> n;
	int sum = 0;
	for (int i = 1;i <= n;i++)
	{
		cin >> a[i];
		sum += a[i];
		dis[i] = sum;
	}
	int m;
	cin >> m;
	for (int i = 0;i < m;i++)
	{
		int x, y;
		cin >> x >> y;
		if (x > y)
		{
			int t = y;
			y = x;
			x = t;
		}
		int ans = dis[y - 1] - dis[x - 1];//可得到从x-》y顺时针走的距离
		cout << min(ans, sum - ans) << endl;//对比顺逆时针走法，选取距离最短的那个
	}

	return 0;
}