Ants
Time Limit: 1000MS | Memory Limit: 30000K | |
Total Submissions: 10371 | Accepted: 4595 |
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
#include<stdio.h> #include<string.h> #include<iostream> #include<algorithm> #define maxn 100000 using namespace std; int main() { int i,j,T,len,n,a[maxn]; scanf("%d",&T); while(T--) { scanf("%d%d",&len,&n); for(i=0;i<n;i++) { scanf("%d",&a[i]); } int minT=0; for(i=0;i<n;i++) { minT=max(minT,min(a[i],len-a[i])); } int maxT=0; for(i=0;i<n;i++) { maxT=max(maxT,max(a[i],len-a[i])); } printf("%d %d\n",minT,maxT); } return 0; }
对于最短时间:让所有蚂蚁都朝着最近的端点走,这种情况下,不会发生两只蚂蚁相遇的情况,而且也不可能在比此更短的时间内走道杆子的端点。
对于最长时间,可以认为所有蚂蚁的运动都是独立的,所以要时间最长,只要求蚂蚁到端点的最长距离就行了。