TIANKENG’s restaurant【区间覆盖】
来源:互联网 发布:淘宝单坑产出什么意思 编辑:程序博客网 时间:2024/05/18 02:45
P - TIANKENG’s restaurant
HDU - 4883TIANKENG 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?
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.
226 08:00 09:005 08:59 09:5926 08:00 09:005 09:00 10:00
116
代码
#include<stdio.h>#include<string.h>#include<algorithm>#include<math.h>#include<queue>#include<stack>#include<vector>#define inf 0x3f3f3f#define mod 100000#define M 24*60+10 // 以1分钟为单位长度 using namespace std;int time[M];int cmp(int x,int y){return x>y;}int main(){int t;scanf("%d",&t);while(t--){int n;scanf("%d",&n);memset(time,0,sizeof(time));for(int i=0;i<n;i++){char s1[10],s2[10];int st,ed,num;scanf("%d%s%s",&num,s1,s2);st=((s1[0]-'0')*10+s1[1]-'0')*60+(s1[3]-'0')*10+s1[4]-'0'; ed=((s2[0]-'0')*10+s2[1]-'0')*60+(s2[3]-'0')*10+s2[4]-'0';for(int j=st+1;j<=ed;j++) //端点处很重要,要细心。。 time[j]=time[j]+num;} sort(time,time+M,cmp); // 最大重复个数 printf("%d\n",time[0]);}return 0; }
0 0
- TIANKENG’s restaurant 【区间覆盖】
- TIANKENG’s restaurant 【区间覆盖】
- TIANKENG’s restaurant【区间覆盖】
- hdoj 4883 TIANKENG’s restaurant 【区间覆盖】
- TIANKENG’s restaurant 【区间覆盖 好题】
- HDU 4883--TIANKENG’s restaurant【区间覆盖 && 暴力】
- 杭电4883-TIANKENG’s restaurant(区间覆盖)
- 【杭电oj】4883 - TIANKENG’s restaurant(区间覆盖)
- hd 4883 TIANKENG’s restaurant (区间覆盖)
- HDU 4883 TIANKENG’s restaurant(区间选点)
- hdu 4883 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
- Q
- 探究碎片--简单的使用方式
- RegisterClassEx函数时的窗口类Style
- 错误:sqlalchemy.exc.IntegrityError: (pymysql.err.IntegrityError)
- 圆桌问题
- TIANKENG’s restaurant【区间覆盖】
- 阶乘之和【DFS】【贪心】
- 想法结合运用
- Python轻松入门-30 多重继承
- Java之显示需要class,ifterface或者enum
- poj 2976 Dropping tests (二分查找)
- [BZOJ3527][Zjoi2014]力(FFT)
- c++注意事项
- JS For in and For (i=0;i<length;i++) different