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<algorithm>
#include<cmath>
using namespace std;
struct Node
{
int str;
int endd;
}a[103];
bool cmp(Node a, Node b) //以结束时间从小到大排序
{
return a.endd < b.endd;
}
int main()
{
int t;
scanf("%d", &t);
while(t--)
{
int i = 0;
int num = 1; //最少可以安排一个
while(scanf("%d%d", &a[i].str, &a[i].endd) && a[i].str != 0 || a[i].endd != 0)
{
i++;
}
sort(a, a + i, cmp);
int pos = a[0].endd;
for(int j = 1; j < i; j++)
{
if(a[j].str >= pos) //如果下一个的起始时间>=上一个结束时间 满足条件
{
num++;
pos = a[j].endd; //记录下新的结束时间
}
}
printf("%d\n",num);
}
return 0;
}