poj1852Ants
2015-12-20 17:58
281 查看
Language: Default Ants
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<cstdlib>
#include<cstring>
#include<algorithm>
#include<cmath>
#define inf 0x3f3f3f3f
using namespace std;
int main()
{
int t,n,m,i,j,k,l;
scanf("%d",&t);
while(t--){
scanf("%d%d",&l,&n);
int minn=inf,maxn=0,pos,temp=inf;
for(i=0;i<n;++i){
scanf("%d",&pos);
if(abs(l-2*pos)<temp){
temp=abs(l-2*pos);
minn=pos;
}
maxn=max(maxn,max(pos,abs(l-pos)));
}
printf("%d %d\n",min(minn,l-minn),maxn);
}
return 0;
}
相关文章推荐
- Linux下SVN安装配置
- 开篇小论
- phpstorm10.0.1 注册
- 详解Android 触摸事件处理和传递过程的来龙去脉
- NuGet发布类库——使用及更新
- 类名+函数名(参数1,参数2.....){.......return this;}
- 根据地址查询经纬度
- MVC4 DropDownList (一) — 使用方法
- codevs 2833 奇怪的梦境
- linux下SVN安装与部署/读取/密码/用户详解
- hdoj--2138--How many prime numbers(暴力模拟)
- objectForKey与valueForKey在NSDictionary中的差异
- Factorial Trailing Zeroes
- hdoj--2138--How many prime numbers(暴力模拟)
- 锂电池电压和容量关系
- [Mysql数据库] mysql数据库使用trigger更新中间表
- 前端开发and设计学习网站
- 【杭电】[2026]首字母变大写
- 库函数atoi()的实现
- 20135317 信息安全系统设计基础期末总结