Ants
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 11415 Accepted: 5059
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
Time Limit: 1000MS Memory Limit: 30000K
Total Submissions: 11415 Accepted: 5059
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 <iostream>
#include <cstdio>
using namespace std;
int main(void)
{
// freopen("A.txt","r",stdin);
int n;
// cin>>n;
scanf("%d",&n);
while(n--)
{
int l,number;
//cin>>l>>number;
scanf("%d%d",&l,&number);
int minmaxn=-1,maxn=-1,maxnn,time;
for(int i=1;i<=number;i++)
{
// cin>>time;
scanf("%d",&time);
maxnn=(time>(l-time))?time:(l-time);
maxn=(maxn>maxnn)?maxn:maxnn;
time=(time<(l-time))?time:(l-time);
minmaxn=(minmaxn>time)?minmaxn:time;
}
// cout<<minmaxn<<" "<<maxn<<endl;
// cout<<maxn<<endl;
printf("%d %d\n",minmaxn,maxn);
}
return 0;
}