# POJ 1852 Ants C语言版

POJ题解 3061浏览

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

Slyar:说下题目大意。n只蚂蚁在一根水平杆上，蚂蚁以1cm/s的速度沿着杆走，长度已知，每只蚂蚁可以向任意两个方向走。蚂蚁一旦走到末端就掉下去，两只蚂蚁一旦碰头就各自掉头向反方向走。问所有蚂蚁掉下去的最快时间和最慢时间。

#include
#include

int main()
{
int t, n, len, ant;
int left, right;
int earliest, latest;
scanf("%d", &t);
while(t--)
{
/* 初始化最快时间以及最慢时间 */
earliest = -1;
latest = -1;
scanf("%d%d", &len, &n);
while(n--)
{
scanf("%d", &ant);
/* 对每只蚂蚁求2个时间 */
left = ant;
right = len - ant;
/* 求较短时间的最大值 以及 较长时间的最大值 */
if (left < right)
{
if (left > earliest) earliest = left;
if (right > latest) latest = right;
}
else
{
if (right > earliest) earliest = right;
if (left > latest) latest = left;
}
}
printf("%d %d\n", earliest, latest);
}
//system("pause");
return 0;
}

### 网友最新评论 (2)

1. 《编程之美》上面有讲。。。
Felix02112年前 (2009-06-04)回复