C++RMQ算法—————Find the hotel

最新推荐文章于 2025-01-12 00:15:00 发布

原创

最新推荐文章于 2025-01-12 00:15:00 发布 · 427 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#C++ #RMQ

本文介绍了一道编程题目，要求在给定的酒店信息中找到那些没有其他酒店同时拥有更低价格和更短距离的酒店。输入包含酒店数量N和每个酒店的价格p_i、距离d_i，输出满足条件的酒店数量及其详细信息。解决方案是利用RMQ算法，首先处理0值，然后按价格升序并以相同价格时距离升序的顺序输出结果。

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

题目描述：

Summer again! Flynn is ready for another tour around. Since the tour would take three or more days, it is important to find a hotel that meets for a reasonable price and gets as near as possible!
But there are so many of them! Flynn gets tired to look for any. It’s your time now! Given the <p i, d i> for a hotel h i, where p i stands for the price and d i is the distance from the destination of this tour, you are going to find those hotels, that either with a lower price or lower distance. Consider hotel h 1, if there is a hotel h i, with both lower price and lower distance, we would discard h1. To be more specific, you are going to find those hotels, where no other has both lower price and distance than it. And the comparison is strict.