hdoj.4883 TIANKENG’s restaurant 20140804

TIANKENG’s restaurant

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

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

226 08:00 09:005 08:59 09:5926 08:00 09:005 09:00 10:00

 

Sample Output

116
 
注：可以将此人数问题转化成一天24小时内的每一分钟有多少人在吃饭，也即是将该时间段内吃饭的人存入相应的时间段数组中，最后将数组中最大元素输出 即是所需最少的凳子数。。。
 
 
#include<stdio.h>#include<string.h>int main(){    int T,n,a,i,j,st1,st2,ed1,ed2,s[1450];    scanf("%d",&T);    while(T--){        scanf("%d",&n);        memset(s,0,sizeof(s));        for(i=0;i<n;i++){            scanf("%d %d:%d %d:%d",&a,&st1,&st2,&ed1,&ed2);            int x=st1*60+st2;            int y=ed1*60+ed2;            for(j=x;j<y;j++){                s[j]+=a;            }        }        int t=s[0];        for(i=1;i<1440;i++){            if(s[i]>t)                t=s[i];        }        printf("%d\n",t);    }    return 0;}