首页 > 代码库 > POJ 1852 Ants
POJ 1852 Ants
Ants
| Time Limit: 1000MS | Memory Limit: 30000K | |
| Total Submissions: 15617 | Accepted: 6753 |
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
白书上有类似的题目....一开始想分开讨论...想了想可以合在一起写。
最小的滑落时间就是 最小里面的最大值
最大的滑落时间就是 最大里面的最大值
/* ***********************************************Author :guanjunCreated Time :2016/10/29 19:34:19File Name :poj1852.cpp************************************************ */#include <iostream>#include <stdio.h>#include <algorithm>#define ull unsigned long long#define ll long long#define mod 90001#define INF 0x3f3f3f3f#define maxn 10010#define cle(a) memset(a,0,sizeof(a))using namespace std;int n,l;int a[1001000];int main(){ #ifndef ONLINE_JUDGE freopen("in.txt","r",stdin); #endif //freopen("out.txt","w",stdout); int t; cin>>t; while(t--){ scanf("%d %d",&l,&n); for(int i=1;i<=n;i++)scanf("%d",&a[i]); int Max=0; int Min=0; for(int i=1;i<=n;i++){ Min=max(Min,min(a[i],l-a[i])); Max=max(Max,max(a[i],l-a[i])); } cout<<Min<<" "<<Max<<endl; } return 0;}
POJ 1852 Ants
声明：以上内容来自用户投稿及互联网公开渠道收集整理发布，本网站不拥有所有权，未作人工编辑处理，也不承担相关法律责任，若内容有误或涉及侵权可进行投诉： 投诉/举报 工作人员会在5个工作日内联系你，一经查实，本站将立刻删除涉嫌侵权内容。