hdu 4883 TIANKENG’s restaurant(思路)
来源:互联网 发布:汽车美容店软件 编辑:程序博客网 时间:2024/05/01 04:23
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.
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
116
代码:
#include <iostream>#include <cstdio>#include <cstring>#include <algorithm>#include <cmath>using namespace std;#define N 10050struct Node{ int num,s,t;} p[N];int time[N];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;}
0 0
- hdu 4883 TIANKENG’s restaurant(思路)
- HDU 4883 TIANKENG’s restaurant (贪心)
- HDU 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- HDU-4883-TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- hdu TIANKENG’s restaurant
- TIANKENG’s restaurant HDU
- HDU 4883 TIANKENG’s restaurant(暴力模拟)
- HDU 4883 TIANKENG’s restaurant (区间更新)
- hdu 4883 TIANKENG’s restaurant(区间更新)
- HDU Problem 4883 TIANKENG’s restaurant (区间暴力)
- 【HDU 4883】TIANKENG’s restaurant(区间更新)
- Mybatis3.x与Spring4.x整合
- 模式识别hw1-------遗传算法寻找最短路径
- 【六月英语——空空的】
- 自制Linux重命名命令
- 程序员编程的 7 + 1 条小贴士
- hdu 4883 TIANKENG’s restaurant(思路)
- 句柄是什么?
- C语言基础知识
- [MYSQL]基础课程笔记2-整型
- js中defer和async的区别
- ASP.NET程序中设置相对路径的方法
- Swift ☞ OC调用
- sql语句技巧--插入时间时非必填的情况
- springmvc复杂表单的编写处理