Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20759 Accepted Submission(s): 7019
![](http://acm.hdu.edu.cn/data/images/1050-1.gif)
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.
![](http://acm.hdu.edu.cn/data/images/1050-2.gif)
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.
3 4 10 20 30 40 50 60 70 80 2 1 3 2 200 3 10 100 20 80 30 50
10 2030
WA 了好些次,老是忽略题目的条件,导致错误。。。 以后写题要认真仔细了
思路 : 找到 最大重叠区间 就可以,
类似 1122333322221 //共享第三个10min
1111222222221 共享第二个10min
1111111111111 共享第一10min, 可知最高层的重叠 代表了第几个10min
代码
#include<stdio.h> #include<algorithm>
#define M 400+2 using namespace std;
bool cmp(int x,int y) { return x>y; } int main() { int n; int r1,r2; scanf("%d",&n); while(n--) { int m; scanf("%d",&m); int room[M]; // 记录 路过每一个房间的 次数 for(int i=0;i<m;i++) { scanf("%d%d",&r1,&r2); if(r1>r2) // 一开始 忘了 r1能够大于r2 尴尬 { int t=r1;r1=r2;r2=t; } if(r1%2) r1--; // 注意奇还是偶 if(r2&1) r2++; // 将区间分好 for(int j=r1;j<=r2;j++) { room[j]++; // 记录路过的次数 } } sort(room,room+M,cmp); // 找到最大的 路过次数 printf("%d\n",room[0]*10); } return 0; }