首页 > 代码库 > Ants
Ants
Ants
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
210 32 6 7214 711 12 7 13 176 23 191
Sample Output
4 838 207
Source
Waterloo local 2004.09.19
Source Code:
#include <cstdio>using namespace std;int minVal(int a,int b){ return a<b?a:b;}int maxVal(int a,int b){ return a>b?a:b;}int Position[1000010];int main(){ int n; int L,num; int minTime,maxTime; while(scanf("%d",&n)!=EOF){ while(n--){ scanf("%d%d",&L,&num); for(int i=0;i<num;++i) scanf("%d",&Position[i]); minTime=maxTime=0; for(int i=0;i<num;++i){ minTime=maxVal(minTime,minVal(Position[i],L-Position[i])); maxTime=maxVal(maxTime,maxVal(Position[i],L-Position[i])); } printf("%d %d\n",minTime,maxTime); } } return 0;}
Ants
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。