poj 1852 ants
2016-04-04 17:43
323 查看
果然数组开小就会runtime error
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
Sample Output
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<cstdio> #include<cstring> #include<algorithm> using namespace std; #define maxn 1000000 int a[maxn+2]; int main() { int T; scanf("%d",&T); while(T--) { int max_t = 0; int min_t = 0; int n,l; scanf("%d%d",&l,&n); for(int i=0; i<n; i++) scanf("%d",&a[i]); for(int i=0; i<n; i++) max_t = max(max_t,max(a[i],l-a[i])); for(int i=0; i<n; i++) min_t = max(min_t,min(a[i],l-a[i])); printf("%d %d\n",min_t,max_t); memset(a,0,sizeof(a)); } return 0; }
相关文章推荐
- ConcurrentHashMap、synchronized与线程安全
- codevs 1115
- SVN & Git
- maven核心概念
- Android ImageView 不显示JPEG图片 及 Android Studio中如何引用图片资源
- 【day0404】C++ return语句的应用
- html各种小技巧收集
- BZOJ4471 : 随机数生成器Ⅱ
- codevs 1086
- 树与图简单剖析
- 如何实现一个 Virtual DOM 算法
- codevs 1044
- 【读书笔记】Android访问远程数据的步骤(Messenger、AIDL、ContentProvider
- 经验
- 华为2016校园招聘上机笔试题[编程题] 简单错误记录
- 15个必知的Android开发者选项
- jQuery- v1.10.2 源码解读
- [LeetCode]309. Best Time to Buy and Sell Stock with Cooldown
- 获取控制台打印数据写入本地文档
- S3C2440 定时器中断配置流程