您的位置:首页 > 其它

hdu 4883 TIANKENG’s restaurant(思路)

2016-06-30 13:02 363 查看


TIANKENG’s restaurant

Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)

Total Submission(s): 2385    Accepted Submission(s): 881


Problem Description

TIANKENG manages a restaurant after graduating from ZCMU, and tens of thousands of customers come to have meal because of its delicious dishes. Today n groups of customers come to enjoy their meal, and there are Xi persons in the ith group in sum. Assuming
that each customer can own only one chair. Now we know the arriving time STi and departure time EDi of each group. Could you help TIANKENG calculate the minimum chairs he needs to prepare so that every customer can take a seat when arriving the restaurant?

 

Input

The first line contains a positive integer T(T<=100), standing for T test cases in all.

Each cases has a positive integer n(1<=n<=10000), which means n groups of customer. Then following n lines, each line there is a positive integer Xi(1<=Xi<=100), referring to the sum of the number of the ith group people, and the arriving time STi and departure
time Edi(the time format is hh:mm, 0<=hh<24, 0<=mm<60), Given that the arriving time must be earlier than the departure time.

Pay attention that when a group of people arrive at the restaurant as soon as a group of people leaves from the restaurant, then the arriving group can be arranged to take their seats if the seats are enough.

 

Output

For each test case, output the minimum number of chair that TIANKENG needs to prepare.

 

Sample Input

2
2
6 08:00 09:00
5 08:59 09:59
2
6 08:00 09:00
5 09:00 10:00

 

Sample Output

11
6

思路:此题用贪心不能得出答案。但是我们换种思路,要求所有时刻所需要的最少的椅子,不就是所有时刻里面人最多的那个时候对应的人数吗?

代码:

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
#define N 10050
struct Node
{
int num,s,t;
} p
;
int time
;
int main()
{
int T,n;
int sa,sb,ta,tb;
scanf("%d",&T);
while(T--)
{
scanf("%d",&n);
memset(time,0,sizeof(time));
for(int i=1; i<=n; i++)
{
scanf("%d %d:%d %d:%d",&p[i].num,&sa,&sb,&ta,&tb);
p[i].s=sa*60+sb;
p[i].t=ta*60+tb;
for(int j=p[i].s;j<p[i].t;j++)
time[j]+=p[i].num;
}
int ans=-1;
for(int i=0;i<10000;i++)
ans=max(ans,time[i]);
printf("%d\n",ans);
}
return 0;
}
内容来自用户分享和网络整理,不保证内容的准确性,如有侵权内容,可联系管理员处理 点击这里给我发消息
标签: