Saruman's Army

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, …, xnof 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.

C++版本一

贪心算法

#include <iostream>
#include <stdio.h>
#include <cstring>
#include <algorithm>


using namespace std;
int r,n,ans;
int a[1100];
bool f[1100];

int main()
{
    while(scanf("%d%d",&r,&n)!=EOF){
        if(r==-1&&n==-1)break;
        for(int i=0;i<n;i++){
            scanf("%d",&a[i]);
        }
        sort(a, a+n);
        //for(int i=0;i<n;i++){
        //    printf("%d",a[i]);
        //}
        ans=0;
        int cur,ent;
        memset(f,false,sizeof(f));
        for(int i=0;i<n;i++){
                ans++;
                cur=i;
                ent=i;
                if(!f[i]){
                    f[i]=true;
                    for(int j=i+1;j<n;j++){
                        if(a[i]+r>=a[j]){
                            cur=j;
                            f[j]=true;
                        }else{
                            break;
                        }
                    }
                    ent=cur;
                    for(int j=cur+1;j<n;j++){
                        if(a[cur]+r>=a[j]){
                            f[j]=true;
                            ent=j;
                        }else{
                            break;
                        }
                    }
                    i=ent;
                }
        }
        cout << ans << endl;
    }
    //cout << "Hello world!" << endl;
    return 0;
}

 

全部评论

相关推荐

07-11 11:10
门头沟学院 Java
请问各位大三兄弟们跟hr说多久实习时间到时候可以提前跑路吗?
程序员小白条:问就是六个月以上,可以一年,实习都这样,你入职后想跑就跑
点赞 评论 收藏
分享
评论
点赞
收藏
分享

创作者周榜

更多
牛客网
牛客网在线编程
牛客网题解
牛客企业服务