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
F
这是一道关于蚂蚁行走的问题。在一根长度为l厘米的水平杆上，有一群蚂蚁以每秒1厘米的速度行走。当蚂蚁到达杆子的任意一端时，它会立即掉落。如果两只蚂蚁相遇，它们会立即转向并朝相反方向行走。题目给出蚂蚁起始位置，但未给出行走方向。任务是确定所有蚂蚁最早和最晚可能在何时全部掉落杆子。输入包含多个案例，每个案例提供杆子长度和蚂蚁数量，以及蚂蚁的初始位置。输出为每个案例中，最早和最晚所有蚂蚁掉下杆子的时间。
最低0.47元/天 解锁文章
311
被折叠的 条评论
为什么被折叠?
到【灌水乐园】发言
