TOJ 1445. Ants
2014-08-01 15:01
267 查看
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.
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.
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.
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.
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.
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> using namespace std; int main(){ int N,m,n,p,minr,maxr,minm,maxm; cin>>N; while(N--){ cin>>m>>n; minr=0; maxr=0; while(n--){ cin>>p; minm=p<m-p?p:m-p; maxm=p>m-p?p:m-p; if(minm>minr) minr=minm; if(maxm>maxr) maxr=maxm; } cout<<minr<<" "<<maxr<<endl; } return 0; }
相关文章推荐
- 关于在toj上使用hash_map(回复黄冶)
- TOJ 3031. Containers
- toj 1709 Incomplete chess boards
- TOJ 1132 Knight Moves BFS求最短路径
- 【TOJ】1416. Catenyms --欧拉路
- TOJ 3584. Chocolate Eating 【二分+枚举】
- ZOJ 3279 Ants
- TOJ 2273 POJ 2818 Making Change DFS C语言
- POJ 2488 DFS+记录路径 TOJ 3520 BFS+记录路径
- TOJ3070. Encryption
- toj 1017. Number Game
- TOJ 3843 快速排序 折半查找
- Uva 10714 - Ants
- toj 3345. Chinese Chess 关键匹配
- TOJ 3771 HDU 4162 Shape Number / 最小表示法
- TOJ 4099 组队要和谐
- uva 10714 Ants
- toj2034 Just the Facts
- TOJ 4351 HDU 4259 Double Dealing
- toj 4353 Estimation(树状数组+二分查找)