Ants
2015-12-05 23:38
639 查看
Ants
Time Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^
题目描述
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 oppositedirections. 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 numbersare 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 isthe latest possible such time.
示例输入
2 10 3 2 6 7 214 7 11 12 7 13 176 23 191
示例输出
4 8 38 207
提示
来源
面向对数据结构和算法不太了解的同学示例程序
#include<iostream> #include<cstdio> #include<cstring> using namespace std; inline int max(int a,int b){ return a>b?a:b; } inline int min(int a,int b){ return a<b?a:b; } int main(){ int nCase, len, n, dist; scanf("%d",&nCase); while(nCase--){ scanf("%d%d",&len, &n); int minLen = -100, maxLen = -100; for(int i=0; i<n; ++i){ scanf("%d",&dist); maxLen = max(maxLen, max(dist, len-dist)); minLen = max(minLen, min(dist, len-dist)); } printf("%d %d\n", minLen, maxLen); } return 0; }
相关文章推荐
- 0005.hive的sql创建内部表语句
- 用matlab实现的教师-考场随机分配
- 文件和字符串变量
- Swift中常见类扩展
- 内核中通过给线程插apc注入dll
- Symmetric Order
- 14-会场安排问题
- Redis常用命令
- 通过异步过程调用(APC)注入DLL
- service介绍之IntentService与Notification前台通知
- Switch
- linux常用命令
- PHP
- codeforces 547B. Mike and Feet 单调栈
- 22
- 昂贵的珍珠垂饰
- 计算机网络_2_TCP/IP
- 去掉电脑快捷方式小箭头
- 第二百四十七天 how can I 坚持
- 查看Ubuntu/Redhat等Linux系统版本号等系统信息