zoukankan      html  css  js  c++  java
  • Ants POJ

    Ants
    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
     1 #include<iostream>
     2 #include<cstring>
     3 #include<cstdio>
     4 #include<algorithm>
     5 using namespace std;
     6 const int maxn = 1e6+10;
     7 int a[maxn];
     8 int ans_min,ans_max;
     9 
    10 int main(){
    11     int t;
    12     cin>>t;
    13     while(t--){
    14         int l,n;
    15         scanf("%d%d",&l,&n);
    16         memset(a,0,sizeof(a));
    17         for( int i=0; i<n; i++ ){
    18             scanf("%d",a+i);
    19         }
    20         ans_max=ans_min=0;
    21         for( int i=0; i<n; i++ ){
    22             ans_min=max(ans_min,min(a[i],l-a[i]));
    23             ans_max=max(ans_max,max(a[i],l-a[i]));
    24         }
    25         printf("%d %d
    ",ans_min,ans_max);
    26 
    27     }
    28 
    29     return 0;
    30 }
    有些目标看似很遥远,但只要付出足够多的努力,这一切总有可能实现!
  • 相关阅读:
    函数指针的调用方式
    C++构造函数和析构函数顺序
    往android主项目中添加辅助项目
    Qt每次运行都是重新编译问题
    函数参数检验的研究
    动态链接库和静态链接库的区别(未完待续)
    MySQL 查看最大连接数, 当期连接数.
    Linux 命令
    Ext treelist 动态切换TreeStore
    Java 日期加减计算.
  • 原文地址:https://www.cnblogs.com/Bravewtz/p/10591469.html
Copyright © 2011-2022 走看看