TIANKENG’s restaurant--hdu4883
来源:互联网 发布:12306网络购票时间 编辑:程序博客网 时间:2024/05/23 16:43
TIANKENG’s restaurant
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 1629 Accepted Submission(s): 588
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.
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
226 08:00 09:005 08:59 09:5926 08:00 09:005 09:00 10:00
Sample Output
11 6
这个题主要思想时,找出重叠时间区间的最大人数!!简单代码,贪心思想
1 #include<stdio.h> 2 #include<string.h> 3 int main() 4 { 5 int n,i,N,j,time[10010],a,b,c,d,e; 6 scanf("%d",&N); 7 while(N--) 8 { 9 int bb,ee,max;10 memset(time,0,sizeof(time));11 scanf("%d",&n);12 max=0;13 for(i=0;i<n;i++)14 {15 scanf("%d%d:%d%d:%d",&a,&b,&c,&d,&e);16 bb=b*60+c;17 ee=d*60+e;18 for(j=bb;j<ee;j++)19 time[j]+=a;//重叠区域相加人数20 }21 for(i=0;i<25*60;i++)22 max=max>time[i]?max:time[i];23 printf("%d\n",max);24 }25 return 0;26 }
0 0
- TIANKENG’s restaurant--hdu4883
- HDU4883 TIANKENG’s restaurant 【贪心】
- hdu4883 & BestCoder Round #2 TIANKENG’s restaurant(暴力)
- hdu4883 TIANKENG’s restaurant 模拟下就好了
- TIANKENG’s restaurant
- TIANKENG’s restaurant
- HDU_4883 TIANKENG’s restaurant
- hdu TIANKENG’s restaurant
- hdoj4883 TIANKENG’s restaurant
- TIANKENG’s restaurant
- HDOJ TIANKENG’s restaurant
- TIANKENG’s restaurant
- 4883 TIANKENG’s restaurant
- hd4883 TIANKENG’s restaurant
- TIANKENG’s restaurant
- B - TIANKENG’s restaurant
- TIANKENG’s restaurant
- TIANKENG’s restaurant
- 二叉树
- Lotto--poj2245
- 书单
- Lake Counting--poj2386
- Nginx下限速限制下载速度实例
- TIANKENG’s restaurant--hdu4883
- copyMakeBorder函数
- android 点滴——XML和JSON对比
- Pet--hdu4707
- JVM查看过程中的一些专业术语解释
- 我是菜鸟,我怕谁--hdu2520
- Android 开发中获取的设备id(每部手机的唯一标识)
- 做一个正气的杭电人--hdu2500
- HDU 4109 Instrction Arrangement拓扑排序 关键路径模板