转载请注明出处：http://blog.csdn.net/u012860063
题目链接：http://acm.hdu.edu.cn/showproblem.php?
Problem Description
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 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-2相应一段走廊。3-4相应一段走廊，如此我们能够把走廊分成200段，标记为a[1]-a[200]。之后我们依据输进的房间序号。就能够算出要用到哪几段的走廊，之后给相应的a[n]值加1就好，最后求出a[n]最大值就是移动的次数了
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <iostream>
using namespace std;
int a , b;
bool cmp(int a , int b)
{
return a > b;
}
void swap()
{
int t = a ;
a = b , b = t ;
}
int main()
{
int N,n,m,i,j,n1,n2;
int c[247];
scanf("%d",&N);
while(N--)
{
scanf("%d",&n);
memset(c,0,sizeof(c));
for(i = 0 ; i < n ; i++)
{
scanf("%d%d",&a,&b);
if(a > b)
swap();
n1 = (a+1)/2;
n2 = (b+1)/2;
for(j = n1 ; j <= n2 ; j++)
c[j]++;
}
sort(c,c+200,cmp);
printf("%d
",c[0]*10);
}
return 0;
}