TIANKENG’s restaurant hd 4883
来源:互联网 发布:淘宝首页轮播图多大 编辑:程序博客网 时间:2024/05/18 03:39
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.
Output
For each test case, output the minimum number of chair that TIANKENG needs to prepare.
Sample Input
2
2
6 08:00 09:00
5 08:59 09:59
2
6 08:00 09:00
5 09:00 10:00
Sample Output
11
6
#include <iostream>#include <stdio.h>#include <string.h>#include <stdlib.h>#include <cmath>using namespace std;#define ll long longint n;int time[1442]; int main(){ int t; scanf("%d",&t); while(t--) { memset(time,0,sizeof(time)); scanf("%d",&n); int sh,sm; int eh,em; int cnt=0; int ans=0; for(int i=1;i<=n;i++) { scanf("%d",&cnt); scanf("%d:%d",&sh,&sm); scanf("%d:%d",&eh,&em); int s=sh*60+sm; int e=eh*60+em; e--; for(int i=s;i<=e;i++) { time[i]+=cnt; } } for(int i=0;i<1440;i++) { if(ans<time[i]) ans=time[i];}printf("%d\n",ans);}return 0;}
0 0
- TIANKENG’s restaurant hd 4883
- hd 4883 TIANKENG’s restaurant (区间覆盖)
- 4883 TIANKENG’s restaurant
- F - TIANKENG’s restaurant hd 4886
- HDOJ 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- hdoj 4883 TIANKENG’s restaurant
- HDU-4883-TIANKENG’s restaurant
- hdu 4883 TIANKENG’s restaurant
- HDU 4883 TIANKENG’s restaurant
- HDOJ 4883 TIANKENG’s restaurant
- HDOJ-4883 TIANKENG’s restaurant
- HDOJ-4883 TIANKENG’s restaurant
- HPU 4883 TIANKENG’s restaurant
- 简单选择排序
- 硬币找零(完全背包)
- FFmpeg应用程序的使用
- 冒泡排序
- dp整数划分问题——03:复杂的整数划分问题
- TIANKENG’s restaurant hd 4883
- POJ1995
- codrecorces B. Far Relative’s Problem
- jsp七大动作指令
- POJ-1328 Radar Installation
- hdu 5723(最小生成树)
- redis扩展
- 循环队列
- 定义一个员工类,自己分析出几个成员,