题解：Saruman's Army（贪心）

嘘......

于 2019-08-19 18:16:33 发布

阅读量187

点赞数

分类专栏：杂七杂八

本文链接：https://blog.csdn.net/weixin_43540515/article/details/99746671

版权

该问题描述了Saruman如何使用最大范围为R的监视石（palantirs）来确保军队中的每个士兵都在其监视范围内。输入包含多个测试用例，每个用例包括R值、士兵数量n以及士兵的位置。输出是最小的palantirs数量。示例解释了如何应用贪心策略解决问题，例如从前往后放置palantirs，确保覆盖所有士兵，而不能让palantirs悬空。

摘要由CSDN通过智能技术生成

Saruman the White must lead his army along a straight path from Isengard to Helm’s Deep. To keep track of his forces, Saruman distributes seeing stones, known as palantirs, among the troops. Each palantir has a maximum effective range of R units, and must be carried by some troop in the army (i.e., palantirs are not allowed to “free float” in mid-air). Help Saruman take control of Middle Earth by determining the minimum number of palantirs needed for Saruman to ensure that each of his minions is within R units of some palantir.
Input
The input test file will contain multiple cases. Each test case begins with a single line containing an integer R, the maximum effective range of all palantirs (where 0 ≤ R ≤ 1000), and an integer n, the number of troops in Saruman’s army (where 1 ≤ n ≤ 1000). The next line contains n integers, indicating the positions x1, …, xn of each troop (where 0 ≤ xi ≤ 1000). The end-of-file is marked by a test case with R = n = −1.
Outpu