Meeting Room Arrangement
来源:互联网 发布:战天堂翅膀进阶数据 编辑:程序博客网 时间:2024/06/13 11:17
Faculty of Engineering of PSU has a large meeting room for faculty staff to organize events and meetings.
The use of the meeting room must be reserved in advance. Since the meeting room is available in 10
hours per day and there may be several events that want to use the meeting room, the best usage policy
is to maximize the number of events in day.
Suppose that the meeting room is available from time 0 to 10 (10 hours). Given the list of start
time and finish time of each candidate event, you are to write a program to select the events that fit in
the meeting room (i.e. their times do not overlap) and give the maximum number of events in a day.
Input
The first line is a positive integer n (1 ≤ n ≤ 100) which determines the number of days (test cases).
Each test case consists of the time of the candidate events (less than 20 events). Each event time
includes 2 integers which are start time(s) and finish time(f), 0 ≤ s ≤ 9, 1 ≤ f ≤ 10 and s < f. The
line containing ‘0 0’ indicates the end of each test case. Note that an event must use at least 1 hour.
Output
For each test case, print out the maximum number of events that can be arranged in the meeting room.
Sample Input
3
0 6
5 7
8 9
5 9
1 2
3 4
0 5
0 0
6 10
5 6
0 3
0 5
3 5
4 5
0 0
1 5
3 9
0 0
Sample Output
4
4
The use of the meeting room must be reserved in advance. Since the meeting room is available in 10
hours per day and there may be several events that want to use the meeting room, the best usage policy
is to maximize the number of events in day.
Suppose that the meeting room is available from time 0 to 10 (10 hours). Given the list of start
time and finish time of each candidate event, you are to write a program to select the events that fit in
the meeting room (i.e. their times do not overlap) and give the maximum number of events in a day.
Input
The first line is a positive integer n (1 ≤ n ≤ 100) which determines the number of days (test cases).
Each test case consists of the time of the candidate events (less than 20 events). Each event time
includes 2 integers which are start time(s) and finish time(f), 0 ≤ s ≤ 9, 1 ≤ f ≤ 10 and s < f. The
line containing ‘0 0’ indicates the end of each test case. Note that an event must use at least 1 hour.
Output
For each test case, print out the maximum number of events that can be arranged in the meeting room.
Sample Input
3
0 6
5 7
8 9
5 9
1 2
3 4
0 5
0 0
6 10
5 6
0 3
0 5
3 5
4 5
0 0
1 5
3 9
0 0
Sample Output
4
4
1
题意:给定一段时间,再给出事情的起始时间和结束时间,算出最多可以完成多少事情。
思路:贪心,就是将会议的结束时间,,从小到大排序每次都是选取当前结束最早的会议,将该会议的开始时间与之前的结束时间进行比较,如果可以就将该会议加入
#include <cstdio>#include <cstdlib>#include <cmath>#include <algorithm>#include<cstring>using namespace std;struct node{ int left; int right;}no[500];bool cmp(node x,node y){ if(x.right==y.right) return x.left<y.left; //如果结束时间相同,比开始时间 else return x.right<y.right; //比结束时间}int main(){ int icase; //freopen("e:\\in.txt","r",stdin); scanf("%d",&icase); while(icase--) { int l,r,i=0; while(scanf("%d%d",&l,&r)==2){ if(l==0&&r==0) break; no[i].left=l; no[i].right=r; i++; } //输入完成 sort(no,no+i,cmp); //贪心排序 int cnt=0,judge=0; for(int j=0;j<i;j++) { if(no[j].left>=judge) { cnt++; judge=no[j].right; } } printf("%d\n",cnt); } return 0;}
0 0
- Meeting Room Arrangement
- UVA Meeting Room Arrangement
- hnu 13003 Meeting Room Arrangement
- Meeting Room Arrangement(贪心)
- UVALive 6606 Meeting Room Arrangement 【搜索】
- meeting room III
- UVALive_6606_Meeting Room Arrangement(最大独立集)
- 南邮 OJ 1462 Meeting Schedule Arrangement
- Sleeping on the floor of a meeting room...
- 【Leetcode】252,253 meeting room系列 区间问题
- Facebook面试题 meeting rooms 求同时最多meeting room的时间
- Arrangement
- Room
- How to book meeting room and setup vacation/OOF in Outlook Calendar
- meeting
- Meeting
- Meeting
- meeting
- Equivalent Sets 【至少加几边使图为强联通】+【 scc +缩点】
- Android 中java反射应用(三)——应用场景及总结
- 从零开始搭建Raspberry Pi机器视觉编程环境
- Uber的合作创始人告诉我们:人工智能如何改变世界
- android 与HTM5 互调入门例子
- Meeting Room Arrangement
- 物联网时代哪三种职业最吃香?--转自美国科技博客TechCrunch撰稿人扎克·苏帕拉(Zach Supalla)
- [动态规划] 洛谷P1063 能量项链 (石子合并)
- 嵌入式开发者技能大全
- HTML5开发者心声:浏览器兼容性成最大问题
- 动态规划-最长公共子序列
- Notes on tensorflow(八)read tfrecords with slim
- 【杂谈】解决Windows系统下上传速度慢的一个小技巧
- html中的相对定位 和 绝对定位