zoukankan      html  css  js  c++  java
  • HDU_4883

    TIANKENG’s restaurant

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


    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 <cstdio>
    #include <cstring>
    #include <string>
    #include <algorithm>
    #include <stack>
    #include <cstdlib>
    using namespace std;
    
    int main() {
    	int t ;
    	cin >> t;
    	while (t --) {
    		int n;
    		scanf("%d",&n);
    		int s1, s2, s3, s4;
    		int c[1500];
    		memset(c, 0, sizeof(c));
    		int num ;
    		while (n --) {
    			scanf("%d",&num);
    			scanf("%d:%d %d:%d",&s1,&s2,&s3,&s4);
    			int be = s1*60 + s2;
    			int en = s3*60 + s4;
    			for (int i = be; i<en; i++)
    				c[i] += num;
    		}
    		int max = 0;
    		for (int i = 1; i<=1440; i++) {
    			if (c[i] > max)
    				max = c[i];
    		}
    		printf("%d
    ",max);
    	}
    	
    	return 0 ;
    }


  • 相关阅读:
    组合模式及C++实现
    YUV422(UYVY)转RGB565源代码及其讲解.md
    会用errno,事半功倍
    可变参数宏
    camera理论基础和工作原理
    !!!??? 2.3 核心模块与应用程序的对比
    KVM与VMware的性能比较
    单片机中定时器与计数器的区别
    编译器对变量的内存分配方式
    【转载】Modelsim 与Vivado联合仿真版本对应问题
  • 原文地址:https://www.cnblogs.com/Tovi/p/6194848.html
Copyright © 2011-2022 走看看