POj1852--Ants-白红宇的个人博客

POj1852--Ants

发布日期：2021-05-09 04:21:11 浏览次数：17 分类：技术文章

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

Ants

Time Limit: 1000MS		Memory Limit: 30000K
Total Submissions: 14939		Accepted: 6492

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 8 38 207 解题思路： 两只蚂蚁相遇后背道而驰和继续原来的方向是没有差别的，可以画一个图来看。好像BC上出国一道类似的题目。 源代码： #include
    
     #include
     
      #include
      
       #include
       
        #include
        
         #include
         
          #include
          
           #include
           
            #include
            #include
             
              #include
              
               #include
               
                #include
                
                 #include
                 
                  #include
                  
                   #include
                   
                    #include
                    
                     using namespace std;typedef long long ll;int location[1000005];int main(){ int t; int n,m; int i,j; int MinTime; int MaxTime; scanf("%d",&t); while(t--) { scanf("%d%d",&n,&m); for(i = 0;i < m; i++) scanf("%d",&location[i]); MinTime = -1; MaxTime = -1; for(i = 0; i < m; i++) { MinTime = max(MinTime,min(location[i],n - location[i])); } for(j = 0; j < m; j++) { MaxTime = max(MaxTime,max(location[j],n - location[j])); } printf("%d %d\n",MinTime,MaxTime); } return 0;}

上一篇：51Nod--1051最大子矩阵和（DP入门）

下一篇：HDU2546--饭卡（01背包）

发表评论

关于作者

喝酒易醉，品茶养心，人生如梦，品茶悟道，何以解忧？唯有杜康！

-- 愿君每日到此一游！

发表评论

最新留言

关于作者

推荐文章