zoukankan      html  css  js  c++  java
  • Saruman's Army(POJ3069)

    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

    Hint

    In the first test case, Saruman may place a palantir at positions 10 and 20. Here, note that a single palantir with range 0 can cover both of the troops at position 20.

    In the second test case, Saruman can place palantirs at position 7 (covering troops at 1, 7, and 15), position 20 (covering positions 20 and 30), position 50, and position 70. Here, note that palantirs must be distributed among troops and are not allowed to “free float.” Thus, Saruman cannot place a palantir at position 60 to cover the troops at positions 50 and 70.

     1 #include<iostream>
     2 #include<algorithm>
     3 using namespace std;
     4 int main()
     5 {
     6     int n, r;
     7     while (cin >> r >> n, n != -1 && r != -1)
     8     {
     9         int a[5000];
    10         for (int i = 0; i < n; i++)
    11             cin >> a[i];
    12         sort(a, a + n);
    13         int i = 0, ans = 0;
    14         while (i < n)
    15         {
    16             int s = a[i++];
    17             while (i < n&&a[i] <= s + r) i++;
    18             int p = a[i - 1];
    19             while (i < n&&a[i] <= p + r) i++;
    20             ans++;
    21         }
    22         cout << ans << endl;
    23     }
    24     return 0;
    25 }

    //这次学习的代码是通过循环控制找到最优位置

  • 相关阅读:
    工作之:oracle 11g deferred_segment_creation段延迟创建(转载他人)
    工作之:数据库锁表问题
    工作之:weblogic的url 使用weblogic连接RAC数据库的方式配置如下
    Oracle和Mysql的区别 转载
    关于fastjson的一些知识
    进程和线程的区别 转载
    同一进程中的线程共享的资源有哪些 转载
    2015-04-20一些知识点
    Java中String类型详解
    2015-04-14一些知识点
  • 原文地址:https://www.cnblogs.com/kangdong/p/8734960.html
Copyright © 2011-2022 走看看