zoukankan      html  css  js  c++  java
  • poj 3069 Saruman's Army

    http://poj.org/problem?id=3069

    Saruman's Army
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 4963   Accepted: 2561

    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.

    Source

     
     
    分析;
    完全覆盖,求最少的影响。贪心。
     
     
    AC代码:
     1 #include<cstdio>
     2 #include<algorithm>
     3 using namespace std;
     4 int a[1005];
     5 int main() {
     6     int r,n;
     7     while(~scanf("%d %d",&r,&n)) {
     8         if(r == -1 && n == -1) break;
     9         for(int i = 0;i < n;i++) {
    10             scanf("%d",&a[i]);
    11         }
    12         
    13         sort(a,a + n);
    14         
    15         int i = 0,ans = 0;
    16         while(i < n) {
    17             int s = a[i++];
    18             while(i < n && a[i] <= s + r) i++;
    19             int ns = a[i-1];
    20             while(i < n && a[i] <= ns + r) i++;
    21             ans++;
    22         }
    23         printf("%d
    ",ans);
    24     }
    25     return 0;
    26 }
  • 相关阅读:
    40个GitHub上最受欢迎的iOS开源项目
    Swift应用开源项目推荐
    swift在github上开源的地址
    必须Mark!43个优秀的Swift开源项目推荐
    Swift中编写单例的正确方式
    Android提高第十一篇之模拟信号示波器
    Android平台音频信号FFT的实现
    ios UINavigationController
    工作记录8:iOS 传值问题总结(7种传值完美介绍)
    利用协议代理实现导航控制器UINavigationController视图之间的正向传值和反向传值
  • 原文地址:https://www.cnblogs.com/jeff-wgc/p/4483286.html
Copyright © 2011-2022 走看看