HDU 1050-Moving Tables（水）

標籤：des   style   http   color   java   os   io   strong   

Moving TablesTime Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 19364    Accepted Submission(s): 6617


Problem DescriptionThe 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.
 
InputThe 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.
 
OutputThe 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

102030題意是一道走廊，兩邊各有200間房子，現在要搬桌子，但走廊中間每次只能通過一張桌子，比如說從1--5 6--10 這樣是可以同時進行的，但如果從1--5 4--10 （有重疊） 這種情況就不能同時進行。要求最少時間。只需要求出最大重疊部分就可以了。可以把走廊想象成200段，編號為1-200.或者每段走廊的編號只需要房子的編號 （i+1）/2即可 
#include <cstdio>#include <iostream>#include <algorithm>#include <cstring>#include <vector>#include <queue>#include <set>using namespace std;const int INF=1<<27;const int maxn=110;int main(){int T,n,hash[210],a,b;cin>>T;while(T--){cin>>n;memset(hash,0,sizeof(hash));for(int i=0;i<n;i++){cin>>a>>b;if(a>b){int t=a;a=b;b=t;}for(int j=(a+1)/2;j<=(b+1)/2;j++)hash[j]++;}int Max=-1;for(int i=0;i<210;i++)if(Max<hash[i])Max=hash[i];cout<<Max*10<<endl;}return 0;}