TIANKENG’s restaurant--hdu4883

最新推荐文章于 2022-04-16 17:04:49 发布

原创最新推荐文章于 2022-04-16 17:04:49 发布 · 402 阅读

0 ·

CC 4.0 BY-SA版权

本文介绍了一个算法案例，通过计算不同顾客群体在特定时间段内就餐所需的最少座位数，以帮助餐厅管理者进行资源的有效分配。该算法利用贪心策略，对输入的时间段进行处理，最终输出在所有重叠时间段内所需的最大座位数。

TIANKENG’s restaurant

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others)
Total Submission(s): 1629 Accepted Submission(s): 588

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

这个题主要思想时，找出重叠时间区间的最大人数！！简单代码，贪心思想

 1 #include<stdio.h>
 2 #include<string.h>
 3 int main()
 4 {
 5     int n,i,N,j,time[10010],a,b,c,d,e;
 6     scanf("%d",&N);
 7     while(N--)
 8     {
 9         int bb,ee,max;
10         memset(time,0,sizeof(time));
11         scanf("%d",&n);
12         max=0;
13         for(i=0;i<n;i++)
14         {
15                 scanf("%d%d:%d%d:%d",&a,&b,&c,&d,&e);
16                 bb=b*60+c;
17                 ee=d*60+e;
18                 for(j=bb;j<ee;j++)
19                 time[j]+=a;//重叠区域相加人数
20         }
21         for(i=0;i<25*60;i++)
22         max=max>time[i]?max:time[i];
23         printf("%d\n",max);
24     }
25     return 0;
26  }