杭电-4883 TIANKENG’s restaurant
2016-07-22 20:16
190 查看
TIANKENG’s restaurant
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 2522 Accepted Submission(s): 933
[align=left]Problem Description[/align]
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?
[align=left]Input[/align]
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.
[align=left]Output[/align]
For each test case, output the minimum number of chair that TIANKENG needs to prepare.
[align=left]Sample Input[/align]
2
2
6 08:00 09:00
5 08:59 09:59
2
6 08:00 09:00
5 09:00 10:00
[align=left]Sample Output[/align]
11
6
[align=left]Source[/align]
BestCoder Round #2
[align=left]Recommend[/align]
liuyiding | We have carefully selected several similar problems for you: 5746 5745 5744 5743 5742
AC代码:
#include<stdio.h> #include<string.h> #include<algorithm> using namespace std; int a[1510]; int main() { int t,n,x,i,j,begin,end,h,m,hh,mm; scanf("%d",&t); while(t--) { memset(a,0,sizeof(a)); scanf("%d",&n); while(n--) { scanf("%d %d:%d %d:%d",&x,&h,&m,&hh,&mm); begin=h*60+m; end=hh*60+mm; for(j=begin;j<end;j++) { a[j]=a[j]+x; } } int ans=0; for(j=1;j<1440;j++) { if(a[j]>ans) { ans=a[j]; } } printf("%d\n",ans); } return 0; }
相关文章推荐
- 2016多校联赛2D Eureka(hdu 5738)
- c语言_函数指针的调用方法
- POJ-----1328
- Linux信号机制与信号处理
- 【codeforces】-699B-One Bomb(思维)
- HDU 5744 Keep On Movin
- wait方法和sleep方法的区别
- c++游戏别踩白块课程设计
- ffplay的快捷键以及选项
- java web servelt
- 站在巨人的肩膀上学习
- 128. Longest Consecutive Sequence
- Android制作简易计算器【JAVA】
- poj2195 Going Home(最大费用最小流)
- Python.Extracting Data from XML
- js学习笔记(比较全)
- 使用WebView同时开发Android和IOS应用
- 【项目管理和构建】——Maven下载、安装和配置(二)
- 机器学习入门
- java中的异常