Holiday Hotel
| Time Limit: 2000MS | Memory Limit: 65536K | |
| Total Submissions: 8098 | Accepted: 3176 |
Description
Mr. and Mrs. Smith are going to the seaside for their holiday. Before they start off, they need to choose a hotel. They got a list of hotels from the Internet, and want to choose some candidate hotels which are cheap and close to the seashore. A candidate hotel M meets two requirements:
- Any hotel which is closer to the seashore than M will be more expensive than M.
- Any hotel which is cheaper than M will be farther away from the seashore than M.
Input
There are several test cases. The first line of each test case is an integer N (1 <= N <= 10000), which is the number of hotels. Each of the following N lines describes a hotel, containing two integers D and C (1 <= D, C <= 10000). D means the distance

这篇博客介绍了如何使用排序和单调栈解决ACM题目POJ 2726 Holiday Hotel。内容涉及输入输出格式、样例分析,主要讨论如何找到距离海岸线M距离范围内最便宜的酒店。
最低0.47元/天 解锁文章

被折叠的 条评论
为什么被折叠?



