Algorithm学习笔记 --- Ants(poj No.1852)培养锻炼里的例题
来源:互联网 发布:聊天室源码下载 编辑:程序博客网 时间:2024/05/17 01:12
Ants
Time Limit: 1000MS Memory Limit: 30000KTotal Submissions: 7418 Accepted: 3426
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
10 32 6 7
Sample Output
4 8
此题的解法是:
假设两只蚂蚁相撞后,继续行走,可以不考虑反向行走,继续走自己的路,
此题与原题有些不同,只是求了一次的运算,如若提交请自行修改。
代码如下:
#include <iostream>#include <cmath>#include <cstdio>using namespace std;#define MAX_N 1000000int x[MAX_N];int L,n;void solve();int main(){ cin>>L; cin>>n; for(int i=0;i<n;i++) cin>>x[i]; solve(); return 0;}void solve(){ int minT=0; for(int i=0;i<n;i++) { minT=max(minT,min(x[i],L-x[i])); } int maxT=0; for(int i=0;i<n;i++) { maxT=max(maxT,max(x[i],L-x[i])); } cout<<minT<<endl; cout<<maxT;}
0 0
- Algorithm学习笔记 --- Ants(poj No.1852)培养锻炼里的例题
- POJ NO.1852 Ants
- POJ-Ants-No.1852
- Ants(POJ NO.1852)
- Ants(POJ No.1852) 脑筋急转弯
- Algorithm学习笔记 --- 约瑟夫问题NO.2
- Ants(No.1852)
- poj 1852 Ants
- POJ 1852 Ants
- poj 1852Ants
- POJ 1852 Ants 蚂蚁
- POJ 1852 Ants
- POJ 1852 Ants
- POJ-1852-Ants
- POJ 1852 Ants
- [ACM] POJ 1852 Ants
- POJ 1852 Ants
- POJ 1852 Ants 模拟
- Android之搜索框的纯代码实现
- ROWLOCK
- 中国已经成为世界货物贸易规模第一大国
- 第五周作业——Dijkstra算法的实现
- STL---set基本使用--取集合的交、并、差、对称差
- Algorithm学习笔记 --- Ants(poj No.1852)培养锻炼里的例题
- 微软编程之美热身赛-长方形
- Win7 Excel打开时读取专用的解决方法
- 黑马程序员_面向对象总结
- HDU 1732 BFS
- HTML(2)
- 病房内
- 双重曝光
- Eclipse上GIT插件EGIT使用手册之一_安装EGIT插件