HDU_4883 TIANKENG’s restaurant
来源:互联网 发布:程序员招聘网站有哪些 编辑:程序博客网 时间:2024/05/29 07:10
TIANKENG’s restaurant
2014-8-4 11:50
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<stdio.h>#include<string.h>using namespace std;#define N 1441int hi, ho, mi, mo, si, so, t, n, ans, p, peo[N];int main(){ scanf ("%d", &t); while (t--) { scanf ("%d", &n); memset (peo, 0, sizeof (peo)); for (int i = 1; i <= n; ++i) { scanf ("%d %d:%d %d:%d", &p, &hi, &mi, &ho, &mo); si = hi * 60 + mi; so = ho * 60 + mo; for (int j = si; j < so; ++j) peo[j] += p; } for (int i = ans = 1; i < N; ++i) if (peo[i] > ans) ans = peo[i]; printf ("%d\n", ans); } return 0;}
0 0
- HDU_4883 TIANKENG’s restaurant
- TIANKENG’s restaurant
- 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--hdu4883
- TIANKENG’s restaurant
- B - TIANKENG’s restaurant
- TIANKENG’s restaurant
- TIANKENG’s restaurant
- TIANKENG’s restaurant
- TIANKENG’s restaurant HDU
- HDOJ 4883 TIANKENG’s restaurant
- USACO_beads
- 热烈祝贺环融科技网站正式上线
- Mindjet 与 Trello 任务管理解决方案之一决高低
- js中cookie的使用详细分析
- SpringDateJpa使用JpaRepository方法出现空指针异常的问题
- HDU_4883 TIANKENG’s restaurant
- shell中调用shell
- JDK5.0垃圾收集优化之--Don't Pause
- OpenStack计算节点上虚拟网络(Neutron)详解
- php获取手机os
- 解释一下Windows的消息机制
- 一段旧代码 ———— linux下C语言操作mysql
- 【DP】poj2229_Sumsets_201408041139
- 未能加载文件或程序集“Microsoft.Office.Interop.Word, Version=11.0.0.0, Cultu