首页    技术博客    PHP教程    数据库技术    前端开发   HTML5    Nginx    php论坛
新用户注册 | 会员登录
加入会员，解锁专属内容
取消
热门标签 | HotTags
当前位置:  开发笔记 > 人工智能 > 正文

NYOJ220推桌子（贪心算法）

作者：倾尘破8 | 来源：互联网 | 2023-05-19 18:50
推桌子时间限制：1000ms|内存限制：65535KB难度：3描述ThefamousACM(AdvancedComputerMaker)Companyhasrenteda

推桌子

时间限制：1000 ms  |  内存限制：65535 KB难度：3
描述
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure. 

The floor has 200 rooms each on the north side and south side along the corridor. Recently the Company made a plan to reform its system. The reform includes moving a lot of tables between rooms. Because the corridor is narrow and all the tables are big, only one table can pass through the corridor. Some plan is needed to make the moving efficient. The manager figured out the following plan: Moving a table from a room to another room can be done within 10 minutes. When moving a table from room i to room j, the part of the corridor between the front of room i and the front of room j is used. So, during each 10 minutes, several moving between two rooms not sharing the same part of the corridor will be done simultaneously. To make it clear the manager illustrated the possible cases and impossible cases of simultaneous moving. 

For each room, at most one table will be either moved in or moved out. Now, the manager seeks out a method to minimize the time to move all the tables. Your job is to write a program to solve the manager's problem.
输入
The input consists of T test cases. The number of test cases ) (T is given in the first line of the input file. Each test case begins with a line containing an integer N , 1 <= N <= 200, that represents the number of tables to move. 
Each of the following N lines contains two positive integers s and t, representing that a table is to move from room number s to room number t each room number appears at most once in the N lines). From the 3 + N -rd 
line, the remaining test cases are listed in the same manner as above.
输出
The output should contain the minimum time in minutes to complete the moving, one per line.
样例输入 
3 
4 
10 20 
30 40 
50 60 
70 80 
2 
1 3 
2 200 
3 
10 100 
20 80 
30 50
样例输出 
10
20
30
上传者

苗栋栋


#include 
#include 
int move[201];
int main()
{
  int T,i,j,table,ans,from,to,tmp;
  scanf("%d",&T);
  while(T--)
     {
        scanf("%d",&table);
        memset(move,0,sizeof(move));
        for(j = 0 ; j         {
           scanf("%d %d",&from,&to);
           from = (from+1)/2;
           to = (to +1)/2;//缩减1—200
          if(from > to)//from<=to
          {
            tmp = from ;
            from = to ;
            to = tmp;
          }
           for(i = from ; i <= to ; ++i)
           ++move[i];//记录每房间区段move次数，即两from和to区间相交时，加1
        }
         ans = 0;
         for(i =1 ;i <= 200 ; ++i)
           if(move[i] > ans)
                    ans = move[i];
         printf("%d\n",ans*10);
     }
  return 0;

}



        
    

        
推荐阅读

        

            
        

    


    

        

            
            

                
                author-avatar
            


            

                倾尘破8            


            

                这个家伙很懒，什么也没留下！            



        

    


    

    

    
    

    

        
Tags | 热门标签

        

            
        

    


    
    

        

            

            

        

        
RankList | 热门文章

        

            
        

    

    


    PHP1.CN | 中国最专业的PHP中文社区 | DevBox开发工具箱 | json解析格式化 |PHP资讯 | PHP教程 | 数据库技术 | 服务器技术 | 前端开发技术 | PHP框架 | 开发工具  | 在线工具

    Copyright © 1998 - 2020 PHP1.CN. All Rights Reserved  |   京公网安备 11010802041100号  |  京ICP备19059560号-4 | PHP1.CN 第一PHP社区      版权所有