Ants
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 15291 | Accepted: 6633 |
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 838 207
考虑最长时间,看看蚂蚁相遇时到底会发生什么。
这样,我们可以认为每只蚂蚁都是独立运动的,所以要求最长时间,只要求蚂蚁到杆子端点的大距离的最大值就好了。
而最短时间,只要求蚂蚁到杆子端点的小距离的最大值就好了。不论最长时间还是最短时间,都只要对每只蚂蚁检查一次就好了,时间复杂度为O(n)
<span style="font-size:14px;">#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;
int a[1000010];
int main()
{
int t;
while(cin>>t)
{
int len,n;
while(t--)
{
cin>>len>>n;
for(int i=0;i<n;i++)
scanf("%d",&a[i]);
int minT=0,maxT=0;
for(int i=0;i<n;i++)
minT=max(minT,min(a[i],len-a[i]));
for(int i=0;i<n;i++)
maxT=max(maxT,max(a[i],len-a[i]));
printf("%d %d\n",minT,maxT);
}
}
return 0;
} </span>