UVA - 10714 Ants-白红宇

UVA - 10714 Ants

阅读量：6904 次

发布时间：2019-06-27

本文共 2233 字，大约阅读时间需要 7 分钟。

最多时间就是每仅仅蚂蚁选择最久的爬行方式

最少时间就是每仅仅蚂蚁选择最快地爬行方式

#include
     
      #include
      #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            
             #include
             
              #include
              
               using namespace std;int main(){ int a,b,i,T,len,n,t; cin>>T; while(T--) { cin>>len>>n; a=b=0; while(n--) { cin>>t; a=max(a,min(len-t,t)); b=max(b,max(len-t,t)); } cout<
               <<" "<<

Time Limit:3000MS

Memory Limit:Unknown

64bit IO Format:%lld & %llu

Description

Problem B: 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.

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) andn, the number of ants residing on the pole. These two numbers are followed byn 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 is the latest possible such time.

Sample input

210 32 6 7214 711 12 7 13 176 23 191

Output for sample input

4 838 207

Piotr Rudnicki

Source

Root :: Competitive Programming 3: The New Lower Bound of Programming Contests (Steven & Felix Halim) :: Problem Solving Paradigms :: Greedy ::

Root :: AOAPC I: Beginning Algorithm Contests (Rujia Liu) ::

Root :: Competitive Programming 2: This increases the lower bound of Programming Contests. Again (Steven & Felix Halim) :: Problem Solving Paradigms ::

Root :: Prominent Problemsetters ::

转载地址：http://llldl.baihongyu.com/

你可能感兴趣的文章

使用Reveal来查看别人的APP界面+白苹果不刷机解决方式