HDU 1050 Moving Tables 【区间覆盖】
来源:互联网 发布:淘宝全球购官网直邮 编辑:程序博客网 时间:2024/06/18 06:07
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 20759 Accepted Submission(s): 7019
Problem Description
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.
![](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.
![](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.
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这道题只需要找到最大重叠区间即可...要注意房间号的奇偶性!!!
#include<stdio.h>#include<string.h>#include<algorithm>using namespace std;bool cmp(int x,int y){return x>y;}int main(){int n,m,i,j,k,t;int r1,r2;int room[200];scanf("%d",&n);while(n--){scanf("%d",&m);memset(room,0,sizeof(room));for(i=0;i<m;i++){scanf("%d%d",&r1,&r2);if(r1>r2){t=r1;r1=r2;r2=t;}r1=(r1+1)/2;r2=(r2+1)/2;for(j=r1;j<=r2;j++){room[j]++;}}sort(room,room+200,cmp);printf("%d\n",room[0]*10);}return 0;}
0 0
- HDU 1050 Moving Tables 【区间覆盖】
- hdu 1050 Moving Tables(最大区间覆盖问题)
- HDU ACM 1050 Moving Tables(贪心 + 区间覆盖问题)
- Moving Tables【区间覆盖】
- hdu 1050 Moving Tables(贪心算法---区间覆盖,重叠数)
- Moving Tables(贪心 区间覆盖)
- HDU 1050 Moving Tables
- hdu 1050 moving tables
- HDU-1050 Moving Tables
- hdu-1050-Moving Tables
- HDU 1050 Moving Tables
- HDU 1050 Moving Tables
- hdu 1050 moving tables
- hdu 1050 Moving Tables
- hdu 1050 Moving Tables
- hdu 1050 Moving Tables
- HDU (1050) Moving Tables
- HDU--1050 -- Moving Tables
- 【BZOJ】【P1453】【WC2005】【Dface双面棋盘】【题解】【线段树+并查集】
- Ubuntu设置启动项顺序
- Java基础——函数、数组
- vs2013编译ffmpeg总结
- Visual studio IDE 与 visual C++之间的对应关系 (Correspondence)
- HDU 1050 Moving Tables 【区间覆盖】
- 第17周项目2-体会函数参数传递
- TextView的省略号(elipsized属性)工作原理
- HashMap的实现原理
- HDU 4734 F(x) (数位DP)
- 如何在MyEclipse中,可以看Spring的源代码,配置如下:
- Java Enum类浅谈
- iOS Xcode中SVN的配置
- 用异或来交换变量是错误的