hdoj 4883 TIANKENG’s restaurant(贪心)
来源:互联网 发布:乐高编程软件31313 编辑:程序博客网 时间:2024/04/30 22:54
TIANKENG’s restaurant
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 1751 Accepted Submission(s): 632
Total Submission(s): 1751 Accepted Submission(s): 632
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>#include<algorithm>using namespace std;int main() {int n;scanf("%d",&n);while(n--){int m;scanf("%d",&m);int per[10005],s[10005],e[10050];char c,f;int a,b,u,v,t[3000],bg,end,j,i;memset(t,0,sizeof(t));for(i=0;i<m;i++) { scanf("%d%d%c%d",&per[i],&a,&c,&b); scanf("%d%c%d",&u,&f,&v); bg=a*60+b; end=u*60+v-1; for(j=bg;j<=end;j++)//将每个分钟时刻的需求量 ,求出! { t[j]+=per[i]; } } sort(t,t+3000);//输出需求最大的时刻! printf("%d\n",t[2999]);}}
0 0
- hdoj 4883 TIANKENG’s restaurant(贪心)
- hdoj 4883 TIANKENG’s restaurant 【贪心】
- HDOJ 4883 TIANKENG’s restaurant(贪心)
- HDOJ 题目4883TIANKENG’s restaurant(贪心)
- HDOJ 4883 TIANKENG’s restaurant(思维)
- HDU 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 4883 TIANKENG’s restaurant
- TIANKENG’s restaurant(贪心)
- 20140916 【 贪心 】 bestcoder #2 + hdoj 4883 TIANKENG’s restaurant
- HDOJ TIANKENG’s restaurant
- hdoj.4883 TIANKENG’s restaurant 20140804
- hdoj 4883 TIANKENG’s restaurant 【区间覆盖】
- HDU(4883)TIANKENG’s restaurant(模拟+贪心)
- AngularJS - 使用RequireJS还是Browserify?
- 分组导航
- ad15 各个层的含义
- Javascript - code snippet - function 1
- 后缀表达式
- hdoj 4883 TIANKENG’s restaurant(贪心)
- Service kongleifeng深究
- 《计算机操作系统》总结一
- XP 文件引用了一个不可用的位置
- AngularJS + RequireJS
- 深入理解IntentService
- PHP 7革新与性能优化
- 数据仓库&大数据学习 记录/笔记
- 简易版网页版计算器