HDU 1050 移桌子(贪心)

传送门：HDU 1050

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

题意：
给你400个房间，每个房间标号，一条栈道的上面全是奇数，下面全是偶数，每十分钟内每个位置的两个房间中间的栈道只能同行1次，问把这n条桌子从不同房间放到另一个房间中至少要几分钟。

思路：
可以计算每个过道需要使用的次数，最大次数*10即为最终答案。
过道编号与房间编号的关系：过道=(房间+1)/2。

代码：

#include<iostream>
#include<algorithm>
#include<cstring>
#include<cstdio>
#define ll long long
#define inf 0x3f3f3f3f
using namespace std;
int t,n;
int vis[210];
bool cmp(int a,int b)
{
  return a>b;
}
int main()
{
  int a,b;
  scanf("%d",&t);
  while(t--)
  {
    memset(vis,0,sizeof(vis));
    int l,r;
    scanf("%d",&n);
    for(int i=0;i<n;i++)
    {
      //过道的标号=(房间号+1)/2；
      scanf("%d%d",&a,&b);
      l=min(a,b);
      r=max(a,b);
      l=(l+1)/2;//求出在哪个过道
      r=(r+1)/2;
      for(int i=l;i<=r;i++)
      {
        vis[i]++;
      }
    }
    sort(vis,vis+200,cmp);
    printf("%d\n",vis[0]*10);
  }
  return 0;
}