SDAU课程练习1000

最新推荐文章于 2017-03-27 19:36:30 发布

窦小雨

最新推荐文章于 2017-03-27 19:36:30 发布

阅读量222

点赞数

分类专栏：贪心

本文链接：https://blog.csdn.net/qq_33402621/article/details/50946080

版权

贪心专栏收录该内容

37 篇文章 0 订阅

订阅专栏

Problem Description

The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.

SDAU课程练习1000

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.

SDAU课程练习1000

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.

Input

The input consists of T test cases. The number of test cases ) (T is given in the first line of the input. 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 N+3-rd line, the remaining test cases are listed in the same manner as above.

Output

The output should contain the minimum time in minutes to complete the moving, one per line.

Sample Input

3

4

    10 20 
  

    30 40 
  

    50 60 
  

    70 80 
  

2

1 3

    2  
   200 
  

3

    10 100 
  

    20 80 
  

    30 50 
  

Sample Output

10

20

30

    题目大意： 
  

    搬桌子，走廊如图，从 70 - 80 这段时间内 这段走廊不可以再搬其他的桌子。每次搬桌子都需要 10 min 
  

    问最少时间。 
  

    思路： 
  

    一开始是想着按照活动安排那种，排序，然后是小木棍那个题那样判断结束。不过课件给了更加简便的方法。啧啧啧。比某 小 房 子 机智多了。 
  

    先把双排变单排，然后每次都记录下来经过的房间号码，其中最大的 * 10 就是最少时间。 
  

    感想： 
  

    群里有好多人再问这个题为什么贪心过不了呢？那么写到这里了，什么是贪心？？还是写到我的总结博文吧。嘻嘻。 
  

    AC代码： 
  

     #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include 
    
 #include
 using namespace std;
 int arr[300];
 int main()
 {
     int N,i,j,k,n,max;
     //freopen("r.txt", "r", stdin);
     int fro,end;
     cin>>N;
     while(N--)
     {
         memset(arr,0,sizeof(arr));
         cin>>n;
         max=0;
         for(i=0;i
         {
             cin>>fro>>end;
             fro=(fro-1)/2;
             end=(end-1)/2;
             if(fro>end) swap(fro,end);
             for(k=fro;k<=end;k++)
             {
                 arr[k]+=1;
             }
         }
         for(j=0;j<200;j++)
         {
             if(arr[j]>max) max=arr[j];
         }
         cout<<max*10<<endl;
     }
     return 0;
 }
 
   

窦小雨

关注

0
点赞
踩
0

收藏

觉得还不错? 一键收藏
0
评论
SDAU课程练习1000

Problem DescriptionThe famous ACM (Advanced Computer Maker) Company has rented afloor of a building whose shape is in the following figure.The floor has 200 rooms each on the north side and sou
复制链接

扫一扫