zoukankan      html  css  js  c++  java
  • 【poj 3069】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

    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.

    题意
    给出一维直线上n个点的相应坐标,和一个参数——距离R,给n个点中尽可能少的点做标记,使得n个点中,任意一个点,在R距离内都有被标记的点。
    题解:
    首先从最左边开始考虑,显然,从左边起,标记的第一个点,在最左边点的右侧。且选择距离R内 距离其最远的点。
    接着,把上一次标记的这个点  能影响的最右边的点  的下一个点,作为最左边的点,开始又一次标记。
     1 #include<cstdio>
     2 #include<iostream>
     3 #include<cstring>
     4 #include<algorithm>
     5 using namespace std;
     6 int ans;
     7 int main(){
     8     //ios::sync_with_stdio(false);
     9     int n,r,x[1005];
    10     while(scanf("%d%d",&r,&n)&&!(r==-1&&n==-1)){
    11         for(int i=0;i<n;i++)cin>>x[i];
    12         sort(x,x+n);
    13         int i=0;ans=0;
    14         while(i<n){
    15             int s=x[i++];
    16             while(i<n&&x[i]<=s+r) i++;
    17             int p=x[i-1];
    18             while(i<n&&x[i]<=p+r) i++;
    19             ans++;
    20         }
    21         printf("%d
    ",ans);
    22     }
    23     return 0;
    24 }
  • 相关阅读:
    Winfrom 减少控件重绘闪烁的方法
    Blazor client-side Preview 预览版 如何调试 Debug
    实用,Windows后台守护进程iNeuDaemon发布。Linux操作系统下使用使用supervisor
    RabbitMQ消息队列之Windows下安装和部署(一)
    Angularjs接收服务端的布尔值
    python基础教程:浅谈python for循环的巧妙运用(迭代、列表生成式)
    Excel合并数据查找函数VLOOKUP()一直显示最后一行数据或者一直报错的解决方法
    RHCE(一)NFS服务详解——搭建与配置
    [WPF 自定义控件]在MenuItem上使用RadioButton
    EF CORE中复杂类型的映射
  • 原文地址:https://www.cnblogs.com/Emine/p/7593304.html
Copyright © 2011-2022 走看看