radar

Describe
Assume the coasting is an infinite straight line. Land is in one side of coasting, sea in the other. Each small island is a point locating in the sea side. And any radar installation, locating on the coasting, can only cover d distance, so an island in the sea can be covered by a radius installation, if the distance between them is at most d.
We use Cartesian coordinate system, defining the coasting is the x-axis. The sea side is above x-axis, and the land side below. Given the position of each island in the sea, and given the distance of the coverage of the radar installation, your task is to write a program to find the minimal number of radar installations to cover all the islands. Note that the position of an island is represented by its x-y coordinates.

Figure A Sample Input of Radar Installations
input
The input consists of several test cases. The first line of each case contains two integers n (1<=n<=1000) and d, where n is the number of islands in the sea and d is the distance of coverage of the radar installation. This is followed by n lines each containing two integers representing the coordinate of the position of each island. Then a blank line follows to separate the cases.
The input is terminated by a line containing pair of zeros
Output
For each test case output one line consisting of the test case number followed by the minimal number of radar installations needed. “-1” installation means no solution for that case.

题意：装最少的雷达能扫描到所有的岛屿，贪心题
思路：所有岛屿位置以d为半径做圆，得到所有跟x轴相交的位置，然后贪心这些位置

AC代码：

///DO NOT ANGRY.
///JUST CALM DOWN AND TAKE IT EASY.
///ENJOY & FOCUS ON CODING.
#include <stdio.h>
#include <string>
#include <stdlib.h>
#include <math.h>
#include <map>
#include <algorithm>
#include <iostream>
using namespace std;
struct node
{
    int x,y;
    double l,r;
} island[1100];
bool cmp(node a,node b)
{
    return a.x<b.x;
}
int main()
{
    int n,d;
    int times=0;
    while(~scanf("%d%d",&n,&d))
    {
        if(n==0&&d==0)break;
        times++;
        int flag=1;
        for(int i=1; i<=n; i++)
        {
            scanf("%d%d",&island[i].x,&island[i].y);
            if(island[i].y>d)
            {
                flag=0;
            }
        }
        if(flag==0)
        {
            printf("Case %d: -1\n",times);
            continue;
        }
        for(int i=1; i<=n; i++)
        {
            island[i].l=island[i].x*1.0-sqrt(d*1.0*d*1.0-(island[i].y*1.0*island[i].y*1.0));
            island[i].r=island[i].x*1.0+sqrt(d*1.0*d*1.0-(island[i].y*1.0*island[i].y*1.0));
        }
        sort(island+1,island+n+1,cmp);
        double tmp=island[1].r;
        int sum=1;
        for(int i=2; i<=n; i++)
        {
            if(island[i].l-tmp>0.00000001)
            {
                sum++;
                tmp=island[i].r;
            }
            else if(island[i].r-tmp<0.0000001)
                tmp=island[i].r;
        }
        printf("Case %d: %d\n",times,sum);
    }
    return 0;
}

刚开始把不符合情况的条件写成了island[i].x>d,以为是下面循环里面的判断出错了，WA了很多次，细节问题要注意哈