非常经典的一个iptables的脚本[zt]
2008-08-07 12:51
483 查看
Moving Tables
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9950 Accepted Submission(s): 3389
Description
The famous ACM (Advanced Computer Maker) Company has rented a floor of a building whose shape is in the following figure.
![](http://my.csdn.net/uploads/201204/30/1335798648_5406.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://my.csdn.net/uploads/201204/30/1335798665_4476.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
10
20
30
Source
HDU1050
这道题也算是贪心的思路吧,从最前面的房间开始搬,每次找到不与本次要搬的所有线路冲突的桌子,一次性将这些桌子搬好,直到全部桌子搬完。
代码及注释如下:
#include<stdio.h> #include<vector> #include<iterator> #include<algorithm> using namespace std; struct M{ int s; int t; }; bool comp(const M &m1, const M &m2){ return m1.s < m2.s; //按照开始的房间号排序 } int main(){ int T, s, t; scanf("%d", &T); while(T--){ int n; vector<M> v; scanf("%d", &n); for(int i = 0; i < n; ++i){ M m; scanf("%d%d", &s, &t); if(s > t){ //有可能从号码大的房间往回搬,若是,则交换s与t s = s ^ t; //交换s,t t = s ^ t; //相当于 s = s ^ t; //int tmp = s; s = t; t = tmp; } m.s = s; m.t = t; v.push_back(m); } sort(v.begin(), v.end(), comp); int ans = 0; for(vector<M>::iterator it = v.begin(); it != v.end();){ //从房间号最小的开始查找 ++ans; int t = (*it).t; for(vector<M>::iterator subit = it; subit != v.end();){ //找到与要搬的线路不冲突的桌子 if((*subit).s > t && !((*subit).s - t == 1 && (*subit).s % 2 == 0)){ //注意对面房间的线路也是冲突的,比如5与6 t = (*subit).t; subit = v.erase(subit); //该桌子已搬完,删除 }else ++subit; //否则继续查找下一张桌子 } it = v.erase(it); //删除 } printf("%d\n", ans * 10); } return 0; } [code;'> 另一种思路是计算出每一段走廊需要用到的次数,找出其中的最大值就是所求结果了:=======================签 名 档======================= 原文地址(我的博客):http://www.clanfei.com/2012/04/824.html 欢迎访问交流,至于我为什么要多弄一个博客,因为我热爱前端,热爱网页,我更希望有一个更加自由、真正属于我自己的小站,或许并不是那么有名气,但至少能够让我为了它而加倍努力。。 =======================签 名 档=======================
相关文章推荐
- 非常经典的一个iptables的脚本
- 非常经典的一个iptables的脚本
- 经典的一个iptables的脚本
- 转载一个不错的iptables脚本
- shell脚本里面一个很经典的调试方法(原创)
- My97DatePicker,一个兼容所有浏览器的日历选择脚本(相当经典)
- 生产者消费者问题 这是一个非常经典的多线程题目,题目大意如下:有一个生产者在生产产品,这些产品将提供给若干个消费者去消费,为了使生产者和消费者能并发执行,在两者之间设置一个有多个缓冲区的缓冲池,生产者
- 分享一个iptables防火墙的脚本和防御ddos攻击的脚本
- 一个浙江人的22条经典经商法则! ZT
- 一个非常经典的ERP教程
- 非常经典的一个单轴摆动控制电路
- 一个非常经典的算法题兼面试题
- 一个非常经典的案例!---多看看对你有好处!
- shell脚本里面一个很经典的调试方法(原创)