《挑战程序设计江赛》P18 题目:Ants POJ 1852 需要想象力的模拟
来源:互联网 发布:汽车资料查询软件 编辑:程序博客网 时间:2024/04/29 18:27
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20836 Accepted: 8598
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
#include <iostream>using namespace std;int x[1000000];int main(){ int k; cin>>k; for(int i=1;i<=k;i++){ int L; int n; cin>>L>>n; for(int i=0;i<n;i++){ cin>> x[i]; } int my_Min=0; for(int i=0;i<n;i++){ my_Min= max( my_Min, min( x[i], L-x[i] ) ); //注意这里是max } int my_Max=-1; for(int i=0;i<n;i++){ my_Max =max( my_Max, max( x[i], L-x[i] ) ); } cout << my_Min << " " << my_Max<<endl; } return 0;}
阅读全文
0 0
- 《挑战程序设计江赛》P18 题目:Ants POJ 1852 需要想象力的模拟
- poj 1852 ants(模拟+想象力)
- 程序设计:POJ的题目Ants
- POJ 1852 Ants 《挑战程序设计竞赛》1.6
- 集训——挑战(P18,Poj NO.1852)
- POJ 1852 Ants 模拟
- 01 题目:POJ 1852 Ants
- POJ 1852 Ants(模拟+弹性碰撞)
- 挑战程序设计竞赛——1.62Ants
- Html5 Canvas挑战你的想象力
- 《挑战程序设计竞赛》P32 题目:Lacking Couting POJ 2386 深搜
- 挑战程序设计 1.6.1 Instance2——Ants
- poj 1852 Ants
- POJ 1852 Ants
- poj 1852Ants
- POJ 1852 Ants 蚂蚁
- POJ 1852 Ants
- POJ 1852 Ants
- OkHttpUtil
- 带儿子去华侨城大剧院看了《金面王朝》儿子看嗨了
- 实战MVP请求数据OKHttp封装RecyclerView上拉刷新下拉加载
- maven jdk build和各种依赖
- BZOJ2929 [Poi1999]洞穴攀行
- 《挑战程序设计江赛》P18 题目:Ants POJ 1852 需要想象力的模拟
- Spring + myBatis + Maven + mySQL 项目搭建
- windows核心编程---DLL注入和API拦截
- 自C程序课程以来的感想
- Python学习日记 第八天 EX18-19
- AtCoder Not so Diverse 并查集&&二分
- 登录加网格切换
- Android Retrofit+RxJava+MVP封装
- 【15-Redis信号处理】