HDOJ 4883 TIANKENG’s restaurant
来源:互联网 发布:数据库开发工程师要求 编辑:程序博客网 时间:2024/05/17 23:09
TIANKENG’s restaurant
Time Limit:1000MS Memory Limit:65536KB 64bit IO Format:%I64d & %I64uDescription
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>#include<algorithm>using namespace std;#define max 24*60+10int re[max];struct node{int people;int time1;int time2;}a[10010];int cmp(int x,int y){return x>y;}int main(){int t,n;scanf("%d",&t);while(t--){scanf("%d",&n);memset(re,0,sizeof(re));for(int i=0;i<n;i++){int h1,m1,h2,m2;scanf("%d %d:%d %d:%d",&a[i].people,&h1,&m1,&h2,&m2);a[i].time1=60*h1+m1;a[i].time2=60*h2+m2;for(int j=a[i].time1;j<a[i].time2;j++){re[j]+=a[i].people;}}sort(re,re+max,cmp);printf("%d\n",re[0]);}return 0;}
0 0
- HDOJ 4883 TIANKENG’s restaurant
- hdoj 4883 TIANKENG’s restaurant
- HDOJ 4883 TIANKENG’s restaurant
- HDOJ-4883 TIANKENG’s restaurant
- HDOJ-4883 TIANKENG’s restaurant
- HDOJ 4883 TIANKENG’s restaurant
- HDOJ TIANKENG’s restaurant
- hdoj 4883 TIANKENG’s restaurant 【贪心】
- hdoj.4883 TIANKENG’s restaurant 20140804
- hdoj 4883 TIANKENG’s restaurant 【区间覆盖】
- HDOJ 4883 TIANKENG’s restaurant(贪心)
- hdoj 4883 TIANKENG’s restaurant(贪心)
- HDOJ 4883 TIANKENG’s restaurant(思维)
- 4883 TIANKENG’s restaurant
- HDOJ 题目4883TIANKENG’s restaurant(贪心)
- 20140916 【 贪心 】 bestcoder #2 + hdoj 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- PHP 变量作用域
- 仙人球的残影
- 大数四则运算
- iOS检测相机或者相册可用
- 前端html如何绘制折线图、条形图、饼图
- HDOJ 4883 TIANKENG’s restaurant
- Android自定义View 简单实现多图片选择控件
- 进程间的通信方式
- 虚函数与纯虚函数的区别
- vagrant入门教程--基本配置(3)
- dwz官网
- spring定时器中 quartz addjob时间配置规则
- java获得当前日期,或把日期转为long型的ms值
- fedora22改网卡名字