UVa 10714 / POJ 1852 / ZOJ 2376 Ants (等价转化思想)

10714 - Ants

Time limit: 3.000 seconds

http://uva.onlinejudge.org/index.php?option=com_onlinejudge&Itemid=8&category=113&page=show_problem&problem=1655

http://poj.org/problem?id=1852

http://acm.zju.edu.cn/onlinejudge/showProblem.do?problemCode=2376

An army of ants walk on a horizontal pole of length l cm, each with a constant speed of 1 cm/s. When a walking ant reaches an end of the pole, it immediatelly falls off it. When two ants meet they turn back and start walking in opposite directions. We know the original positions of ants on the pole, unfortunately, we do not know the directions in which the ants are walking. Your task is to compute the earliest and the latest possible times needed for all ants to fall off the pole.

The first line of input contains one integer giving the number of cases that follow. The data for each case start with two integer numbers: the length of the pole (in cm) and n, the number of ants residing on the pole. These two numbers are followed by nintegers giving the position of each ant on the pole as the distance measured from the left end of the pole, in no particular order. All input integers are not bigger than 1000000 and they are separated by whitespace.

For each case of input, output two numbers separated by a single space. The first number is the earliest possible time when all ants fall off the pole (if the directions of their walks are chosen appropriately) and the second number is the latest possible such time.

Sample input

 
2
10 3
2 6 7
214 7
11 12 7 13 176 23 191

Output for sample input

4 8
38 207

题意：

一根杆子上有n只蚂蚁，相撞则转向，求全部掉下去用的最少最多时间。

思路：

对于最少时间很容易想到就是一次都没有碰撞，在len/2左边的向左，右边的向右；
但是对于最长时间，似乎是要碰撞次数尽量多但是还与碰撞位置有关，很复杂？可以等价转换嘛：A，B碰撞反向运动可以等价为A，B保持原方向运动。（蚂蚁们都是一模一样的）

完整代码：

/*UVaOJ: 0.075s*/
/*POJ: 125ms,144KB*/
/*ZOJ: 70ms,180KB*/

#include <cstdio>
using namespace std;

int main()
{
	int t;
	scanf("%d", &t);
	while (t--)
	{
		int len, n, x;
		scanf("%d%d", &len, &n);
		int min = 0, max = 0;
		while (n--)
		{
			scanf("%d", &x);
			if (x > (len >> 1))
				x = len - x;
			if (min < x)
				min = x;
			x = len - x;
			if (max < x)
				max = x;
		}
		printf("%d %d\n", min, max);
	}
	return 0;
}