POJ#1852 Ants

Ants

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 28006		Accepted: 10861

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

Source

Waterloo local 2004.09.19

 

 

题意：一木板长度为L，其上有n只蚂蚁，每只蚂蚁头朝向不确定，在其行进时，若两只向遇，则都掉头继续走。

输入n个数据，表示初始时每只蚂蚁的位置。输出所有蚂蚁都走下木板的最长和最短时间。

思路：两只蚂蚁相遇时都掉头继续走，相当于穿过对方继续走（因为每只蚂蚁无区别），故最短时间：所有蚂蚁都以能够最快走下木板的方向行进，最短为所有蚂蚁时间中的最大值（以保证所有蚂蚁都走完）。最长时间类似。对每只蚂蚁检查一次，为O(n)。

代码：

 1 #include<iostream>
 2 using namespace std;
 3 int main() {
 4     int num,len,n;
 5     cin >> num;
 6     while (num--) {
 7         cin >> len >> n;
 8         int min=0, max=0;
 9         int cen = len / 2;
10         int pos;
11         for (int i = 0; i < n; i++) {
12             cin >> pos;
13             int big = pos>cen?pos:(len-pos);
14             int small = pos>cen?(len-pos):pos;
15             max = big > max ? big : max;
16             min = small > min ? small : min;
17         }
18         cout << min <<' '<< max<<endl;
19     }
20     return 0;
21 }

 

转载于:https://www.cnblogs.com/woria/p/10610628.html