HDU 1050 POJ 1083 Moving Tables

题目链接：点击打开链接

贪心问题。

Moving Tables

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 35472    Accepted Submission(s): 11681

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.

 

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

102030

题目大意是公司有400房间，有一条走廊，现在要搬东西，给出要搬动的次数和每次搬动的房间号，每次需要十分钟，搬动过程那段走廊没法搬其他的，，求最大搬动时长。

由于房间是相对着的，题目要求不能重复使用走廊，所把相对的房间一块搬走，记录搬走时的时间，对以前输入的时间进行遍历，找出被占用时间最大的那个区间，记录那个区间的次数，此时可以引用数组的下标进计数。最后输出最大值乘10.

代码实现：

#include<iostream>#include<algorithm>#include<cmath>#include<cstring>using namespace std;struct node{int start;int end;}p[205];int main(){int t,n,i,s,e,j,sum,a[500],max;cin>>t;while(t--){cin>>n;max=-1;memset(a,0,sizeof(a));for(i=0;i<n;i++){cin>>s>>e;if(s>e)swap(s,e);s=(s+1)/2;e=(e+1)/2;p[i].start=s;p[i].end=e;for(j=p[i].start;j<=p[i].end;j++){a[j]++;if(a[j]>max)max=a[j];  } }cout<<max*10<<endl;}return 0;}