zoukankan      html  css  js  c++  java
  • HDU Problem 4883 TIANKENG’s restaurant (区间暴力)

    TIANKENG’s restaurant

    Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 131072/65536 K (Java/Others)
    Total Submission(s): 2298    Accepted Submission(s): 838
    地址

    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 <cstdio>
    #include <cstring>
    #include <iostream>
    #include <algorithm>
    #define MAX_N 2000
    #define MAX(a, b)  (a > b)? a: b
    using namespace std;
    int peo[MAX_N];
    
    int main() {
    	int t, n, sth, m, stm, edh, edm;
    	scanf("%d", &t);
    	while (t--) {
    		scanf("%d", &n);
    		int ans = 0;
    		memset(peo, 0, sizeof(peo));
    		for (int i = 0; i < n; i++) {
    			scanf("%d%d:%d%d:%d", &m, &sth, &stm, &edh, &edm);
    			for (int j = sth * 60 + stm; j < edm + edh * 60; j++) {
    				peo[j] += m;
    			}
    		}
    		for (int i = 0; i <= 1440; i++) {
    			ans = MAX(ans, peo[i]);
    		}
    		printf("%d
    ", ans);
    	}
    	return 0;
    }


  • 相关阅读:
    scrapy爬取某网站,模拟登陆过程中遇到的那些坑
    Linux平台安装MongoDB
    Oracle HAVING子句
    oracle查找重复记录-转
    PLSQL存储过程(基础篇)-转
    oracle for update和for update nowait的区别
    Oracle两个数据库互相访问,DBLink使用-转
    中国人素质低的根本原因
    威胁李嘉诚是愚蠢的
    回归农村,这才是我想要的生活
  • 原文地址:https://www.cnblogs.com/cniwoq/p/6770953.html
Copyright © 2011-2022 走看看