hdu 4883 TIANKENG’s restaurant（区间更新）

最新推荐文章于 2017-03-29 14:26:00 发布

foreverwy

最新推荐文章于 2017-03-29 14:26:00 发布

阅读量247

点赞数

CC 4.0 BY-SA版权

分类专栏： acm-算法

本文链接：https://blog.youkuaiyun.com/foreverwy/article/details/50273109

acm-算法专栏收录该内容

28 篇文章

订阅专栏

本文概述了AI音视频处理领域的关键技术，包括视频分割、语义识别、自动驾驶、AR、SLAM等，并探讨了其在实际应用中的作用。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

TIANKENG’s restaurant

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)

Total Submission(s): 1803 Accepted Submission(s): 658

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
题目大意：给出一系列客人来的时间与走的时间，求出至少需要多少把椅子。
解题思路：来了n个客人加上n,走了就减去n.运用结构体由小到大排成，求取最大值。
#include<stdio.h>
#include<string.h>
#include<algorithm>
#include<string.h>
using namespace std;
struct G
{
	int num;
	int time;
}guest[21000];
int cmp(G a,G b)
{
	if(a.time==b.time)
	   return a.num<b.num;
	return a.time<b.time;
}
int main()
{
	int T;
	scanf("%d",&T);
	while(T--)
	{
		memset(guest,0,sizeof(guest));
		int i,n,h,m,num,cnt=0,s=0,max=0;
		scanf("%d",&n);
		for(i=0;i<n;i++)
		   {
		   	  scanf("%d %d:%d",&num,&h,&m);
		   	  guest[cnt].time=h*60+m;
		   	  guest[cnt++].num+=num;
		   	  scanf("%d:%d",&h,&m);
		   	  guest[cnt].time=h*60+m;
		   	  guest[cnt++].num-=num;
		   }
		sort(guest,guest+cnt,cmp);
	    for(i=0;i<cnt;i++)
	    {
	    	s+=guest[i].num;
	    	if(max<s)
	    	   max=s;
	    }
	    printf("%d\n",max);
	}
	return 0;
}