POJ - 1852 Ants

问题描述：

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 n integers 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

SAMPLEOUTPUT：

4 8
38 207

思路：

题意是让我们求第一只蚂蚁落杆的时间以及最后一只蚂蚁落杆的时间，看似很复杂，要考虑两只蚂蚁相遇时的各种情况，其实不然，每只蚂蚁无论在什么与另外的蚂蚁相遇，掉下木棍的时间都只有两种，当前的位置a，以及根子长l-a。
那我们只要每输入一组数据，对这两个数据进行比较即可，很容易就能得到最大和最小值。

AC代码：

#include<bits/stdc++.h>
using namespace std;
int main()
{
	int T;
	scanf("%d",&T);//建议这样写，用cin交了一发tle
	while(T--)
	{
		int minmum=0,maxmum=0,len,n;
		scanf("%d%d",&len,&n);//建议这样写，用cin交了一发tle
		int a;
		for(int i=0;i<n;i++)
		{
			scanf("%d",&a);
			maxmum=max(maxmum,max(a,len-a));
			minmum=max(minmum,min(a,len-a));
		}
		printf("%d %d\n",minmum,maxmum);
	}
	return 0;
 }