【poj1852】Ants 乱搞
来源:互联网 发布:linux 匹配文件内容 编辑:程序博客网 时间:2024/06/06 14:13
Ants
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20360 Accepted: 8441
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
很经典的题目嘞。
因为蚂蚁碰头之后速度啥的都没变,只是方向变了。那么就相当于两只蚂蚁擦肩而过。(好好理解一下)这样问题就很好解决了。
#include<iostream>#include<cstdio>#define INF 0x3f3f3f3fusing namespace std;int T,l,n;int main(){ scanf("%d",&T); while(T--) { scanf("%d%d",&l,&n); int maxx=0,minn=0; for (int i=0;i<n;i++) { int x; scanf("%d",&x); maxx=max(maxx,max(l-x,x)); minn=max(minn,min(l-x,x)); } printf("%d %d\n",minn,maxx); } return 0;}
阅读全文
1 0
- 【poj1852】Ants 乱搞
- POJ1852(Ants)
- poj1852 Ants
- poj1852 Ants
- POJ1852 Ants
- POJ1852 Ants
- POJ1852-Ants
- poj1852(Ants)
- POJ1852 Ants
- POj1852--Ants
- POJ1852 Ants
- 【poj1852】Ants
- poj1852 Ants
- POJ1852 Ants
- POJ1852 Ants
- POJ1852-Ants
- poj1852 Ants
- poj1852 Ants
- MySQL中的异常处理,游标
- redis之主从复制(11)
- Task 11
- 在ubuntu 16.04上安装opencv和opencv_contrib
- 关于算法的时间复杂度
- 【poj1852】Ants 乱搞
- macOS安装homebrew命令
- redis之持久化(12)
- Git的使用
- hibernate 报错Unable to create requested service [org.hibernate.engine.jdbc.env.spi.JdbcEnvironment]
- 巩固与修炼(三)
- 微信公众号开发日志(一)
- Java 自定义异常
- 重叠相加法和重叠保留法的原理