【无标题】

最新推荐文章于 2025-04-15 10:48:14 发布

laocooon523857886

最新推荐文章于 2025-04-15 10:48:14 发布

阅读量7.1k

点赞数

CC 4.0 BY-SA版权

分类专栏： C/C++ 文章标签：蓝桥杯职场和发展

本文链接：https://blog.csdn.net/laocooon/article/details/123390256

这篇博客讨论了一个关于快餐店排队问题的算法。给定每个顾客的到达时间、服务时间和最大忍受排队人数，计算最后一个顾客是否能成功点餐及开始服务的时间。题目提供了一组样例输入和输出，解释了当顾客到达并发现队伍超过其忍受人数时会放弃的情况。

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

Fast Food Restaurant What a nice holiday! After travelling to a small beautiful town, Tom plans to get something to eat, finally he finds a small fast food restaurant with a long queue for ordering. He wonders how long he has to wait before ordering his food. Giving you N customers, for each customer you will be given the arrival time A, the service time O needed for making order and the maximum number L of the people representing that if there are more than L people ahead of him (when he/she arrives) in the queue, the customer will give up. Input The input contains multiple test cases. For each test case, the first line contains a number N indicating the number of customers. Each of the following N lines contains three numbers, Ai , Oi and Li corresponding to the i-th customer. It is guaranteed that the sequence of arrival times is non-decreasing (if two customers have the same arrival time, the customer who is earlier in the input is considered to have arrived ea