贪心算法—杭电1050 Moving Tables
来源:互联网 发布:戴尔显卡切换软件 编辑:程序博客网 时间:2024/06/05 11:27
http://acm.hdu.edu.cn/showproblem.php?pid=1050
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 17815 Accepted Submission(s): 6093
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
102030
#include<iostream>using namespace std;int main(){ int cishu,k; cin>>cishu; for(k=1;k<=cishu;k++) { int n,i,j,count[1000]; memset(count,0,sizeof(count)); cin>>n; int a,b,temp; for(j=1;j<=n;j++) { cin>>a>>b; a=(a-1)/2; b=(b-1)/2; if(a>b) { temp=a; a=b; b=temp; } for(i=a;i<=b;i++) count[i]++; } int max=count[1]; for(j=1;j<=200;j++) if(max<count[j]) max=count[j]; cout<<max*10<<endl; } return 0;}
0 0
- 贪心算法—杭电1050 Moving Tables
- 1050 Moving Tables 贪心算法
- 【杭电1050】Moving Tables
- 杭电1050-Moving Tables
- moving tables贪心算法
- 贪心算法——Hdu 1050 Moving Tables
- hdu 1050 Moving Tables(贪心算法)
- 杭电 Moving Tables
- 【1050 Moving Tables 贪心】
- Moving Tables hdu1050 贪心算法
- Hdu1050 - Moving Tables - 贪心算法
- 贪心算法-HDU1050-Moving Tables
- hdoj1050 Moving Tables(贪心算法?)
- Moving Tables(杭电1050)(贪心---区间不重叠问题)
- 杭电 1150 moving tables
- hdu 1050 Moving Tables (贪心)
- hdu 1050 moving tables 贪心
- hdu 1050 Moving Tables (贪心)
- HTML(4)
- 浅谈导航站SEO优化的一些心得:实在与简洁
- Xfire客户端异常---Caused by: java.net.SocketTimeoutException: Read timed out
- 黑马程序员 ---- this 和 super 的方法调用
- js 判断浏览器插件,判断是否是windows机器
- 贪心算法—杭电1050 Moving Tables
- Activity的四种launchMode
- 判断字节序
- android模拟器鼠标滑动 经常出现搜索框 C现象
- iPhone中删除app时icon晃动的动画
- UITableView隐藏多余的分割线
- android横竖屏切换与activity的销毁重建
- 命令行查看android数据库
- HDU4737线段树