贪心-G Moving Tables

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.

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

题的意思是现在有一层楼，走廊南北两侧各有200个房间，现需要将n张桌子从一个房间搬入另一个房间。经理制定如下计划：一张办公桌从一个房间移到另一个房间最多用十分钟。当从房间i移动一张办公桌到房间j，两个办公室之间的走廊都会被占用。所以，每10分钟内，只要不是同一段走廊，都可以在房间之间移动办公桌。求搬这些桌子的最小时间。
假设桌子（从房间30搬到50）和（从房间60搬到90），这是允许的，因为没有占用公共的走廊；
但如果（从房间20到40）和（从房间31到80）这是不允许的，因为要占用公共的走廊。
我们将每个房间之间的走廊作为一个统计单位，当所有的办公桌都搬运完成之后，看看这段走廊到底需要占用多少次。然后统计所有的走廊被占用的最大值max，这个值就是要单独安排的搬运次数，乘以10就是总的搬运时间。

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
 using namespace std;
 int main() 
{
    int m,n;
    int move[200];
    int from,to;
    cin>>m;
    while(m--)
    {
        memset(move,0,sizeof(move));
        cin>>n;
        for(int i=0;i<n;i++)
        {
           cin>>from>>to;
           from=(from-1)/2;
           to=(to-1)/2;
           if(from>to)//确保from<to
           swap(from,to);
           for(int j=from;j<=to;j++)//占用走廊情况
           move[j]++;
        }
        int max=0;
        for(int k=0;k<200;k++)//所有走廊被占用的最大值
        {
            if(move[k]>max)
            max=move[k];
        }
        cout<<max*10<<endl;
    } 
  }