Ants
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 17451 | Accepted: 7436 |
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
题目大意:一群蚂蚁在一根绳子上走,走到边缘会掉下去,两只蚂蚁相遇会各自往相反方向走,输入绳子长度,和n个蚂蚁在绳子上的坐标,输出蚂蚁到达边界的最长时间和最短时间。
思路题,因为蚂蚁速度都相等,不需要对蚂蚁进行区分,所以可以看作两个蚂蚁相遇后不往相反方向走,而是径直往前走,这样只需要一变循环比较每个蚂蚁的最大值最小值即可。思路比较难想。
附上AC代码:
#include<bits/stdc++.h>
using namespace std;
const int maxn=1000000+5;
int cnt[maxn];
int T,l,n;
int mind,maxd;
int main()
{
cin>>T;
while(T--)
{
cin>>l>>n;
for(int i=0;i<n;i++)
cin>>cnt[i];
mind=maxd=0;
for(int i=0;i<n;i++)
{
mind=max(mind,min(cnt[i],l-cnt[i]));
maxd=max(maxd,max(cnt[i],l-cnt[i]));
}
cout<<mind<<' '<<maxd<<endl;
}
return 0;
}