PO3069(贪心)

最新推荐文章于 2021-07-25 13:34:05 发布

原创最新推荐文章于 2021-07-25 13:34:05 发布 · 1.4k 阅读

0 ·

本内容遵循CC 4.0 BY-SA版权协议

收录于

POJ

这是一篇关于利用贪心算法解决POJ3069问题的博客。题目要求确定在直线上领导军队时，Saruman需要最少数量的palantirs（具有特定有效范围的魔法球）来确保每个士兵都在一个palantir的范围内。输入包含多个测试用例，包括palantir的最大范围R和军队人数n，以及士兵的位置。解决方案是按顺序选择点作为标记点，确保每个点都在标记点的范围内。

开发板推荐：天空星STM32F407VET6开发板

超高性价比 STM32主控 | 超高主频 | 一板兼容百芯 | 比赛神器 | 沉金彩色丝印

点击查看

POJ3069(贪心)

Saruman’s Army

Description

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.

Output

For each test case, print a single integer indicating the minimum number of palantirs needed.

Sample Input

0 3
10 20 20
10 7
70 30 1 7 15 20 50
-1 -1

Sample Output

2
4

题意

直线上有N个点，从这N个中选取若干个加上标记。对每一个点，其距离为R以内的区域里必须要有代标记的点，至少需要有多少个点被标记。

思路

对坐标按从小到大进行排序。选取第一个点X[0]为初始点，选取小于等于X[0]+r中最大点最为标记点。选取大于X[0]+2r的最小点最为第二个初始点。以此类推计算出所有的标记点。

代码

public class SarumansArmy {

  public static void main(String[] args) {
    Scanner sc = new Scanner(System.in);
    while (true) {
      int r = sc.nextInt();
      int n = sc.nextInt();
      if (n == -1 && r == -1) {
        break;
      }
      int[] x = new int[n];
      for (int i = 0; i < n; i++) {
        x[i] = sc.nextInt();
      }
      Arrays.sort(x);
      int falg;
      int count = 0;
      for (int i = 0; i < x.length; ) {
        falg = x[i++];
        while (i < x.length && x[i] - falg <= r) {
          i++;
        }
        int p = x[i - 1];
        while (i < x.length && x[i] - p <= r) {
          i++;
        }
        count++;
      }
      System.out.println(count);
    }
    sc.close();
  }
}