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

    Saruman's Army
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 20626   Accepted: 9988

    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

     
     
     1 #include <iostream>
     2 #include <cstdio>
     3 #include <algorithm>
     4 
     5 using  namespace std;
     6 
     7 const int max_n =  1e3 + 10;
     8 
     9 int n,r;
    10 int x[max_n];
    11 
    12 void solve()
    13 {
    14     sort(x,x+n);
    15     int i=0,ans=0;
    16     while(i<n)
    17     {
    18         int start=x[i];
    19         ++i;
    20 
    21         while(i<n && x[i]-start<=r)
    22         {
    23             ++i;
    24         }
    25 
    26         // 标记此时的x[i-1]
    27         // x[i]不满足上述判断条件
    28         int right=x[i-1];
    29 
    30         while(i<n && x[i]-right<=r)
    31         {
    32             ++i;
    33         }
    34 
    35         ++ans;
    36     }
    37 
    38     printf("%d
    ",ans);
    39 }
    40 
    41 int main()
    42 {
    43     while(scanf("%d %d",&r,&n)!=EOF)
    44     {
    45         if(r==-1 && n==-1)
    46         {
    47             break;
    48         }
    49         for(int i=0;i<n;++i)
    50         {
    51             scanf("%d",&x[i]);
    52         }
    53         solve();
    54     }
    55     return 0;
    56 }
  • 相关阅读:
    EEPROM与FLASH
    Sublime Markdown预览插件安装流程
    挖矿算法比较(转)
    CPU based record
    MVC学习之数据库开发模式:三种开发模式总结:
    MVC学习之数据库开发模式:模型优先实例介绍
    MVC学习之数据库开发模式:代码优先实例介绍
    MVC学习之数据库开发模式:数据库优先实例介绍
    DataSet之将连个DataSet集合合并成一个DataSet集合
    索引和长度必须引用该字符串内的位置。参数名: length
  • 原文地址:https://www.cnblogs.com/jishuren/p/12250197.html
Copyright © 2011-2022 走看看