Poj1852Ants

                                                                                                                                                 Ants

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 15943		Accepted: 6868

Description

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.

Input

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.

Output

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

Sample Output

4 8
38 207

很经典的一道题 又碰到啦 就总结下，第一次看到这个题的时候，压根无从下手，看啦书后发现 这么 简单 ，果然我是脑残 ，我好菜啊

下面的是我理解题意后，写的代码 习惯性排序，看着比较难受（最后附有标准代码，真是）

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[1000000 + 10];
int main()
{
	int T;
	scanf("%d",&T);
	while(T--){
		int l, n,x,b;
		scanf("%d%d",&l,&n);
		for(int i = 0;i < n;i ++)
		scanf("%d",&a[i]);
		sort(a,a+n);
		int k=l-a[0];
		if(k<a[n-1])
		k=a[n-1];
		for(int i =0 ;i < n;i ++){
			if(l-a[i]<a[i])
			a[i]=l-a[i];
		}
		sort(a,a+n);
 		printf("%d %d\n",a[n-1],k);
	}
return 0;
}

白皮书上的代码，聚聚写得真的是一看就懂，简洁（弱弱 无奈）

#include<stdio.h>
#include<algorithm>
using namespace std;
int a[1000000 + 10];
int main()
{
	int T;
	scanf("%d",&T);
	while(T--){
		int l, n,x,b;
		scanf("%d%d",&l,&n);
		for(int i = 0;i < n;i ++)
		scanf("%d",&a[i]);
		int maxT = 0,minT = 0;
		for(int i = 0;i < n;i ++)
			maxT = max(maxT,max(a[i],l-a[i]));
		for(int i = 0;i < n;i ++)
			minT = max(minT,min(a[i],l-a[i]));
 		printf("%d %d\n",minT,maxT);
	}
return 0;
}