Radar Installation

题目链接
描述
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
输入
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
输出
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.
样例输入

3 2
1 2
-3 1
2 1

1 2
0 2

0 0

样例输出

Case 1: 2
Case 2: 1

解题思路:

放置雷达的三种情况:

#include<algorithm>
#include<iostream>
#include<cstdio>
#include<cmath>
using namespace std;
struct Radar{
    double start,end;
    bool friend operator < (Radar a,Radar b){
        return a.start < b.start;
    }
}radar[1005];
int main(){
    int n,d,x,y,m,num,flag;
    double l,r;
    m = 1;
    while(scanf("%d%d",&n,&d)){
        if(!n && !d)
            break;
        flag = true;
        for(int i = 0;i < n;i++){
            scanf("%d%d",&x,&y);
            if(y > d)
                flag = false;
            radar[i].start = x - sqrt(d * d - y * y);
            radar[i].end = x + sqrt(d * d - y * y);
        }
        if(!flag){
            printf("Case %d: -1\n",m++);
            continue;
        }
        sort(radar,radar + n);
        num = 1,l = radar[0].start,r = radar[0].end;//切记l和r是double类型!!!!!
        for(int i = 1;i < n;i++){
            if(radar[i].start >= l && radar[i].end <= r){//对应情况1
                l = radar[i].start;
                r = radar[i].end;
            }
            else if(radar[i].start <= r && radar[i].end >= r)//对应情况2
                l = radar[i].start;
            else if(radar[i].start > r){//对应情况3
                l = radar[i].start;
                r = radar[i].end;
                num++;
            }
        }
        printf("Case %d: %d\n",m++,num);
    }
    return 0;
}