POJ - 1328 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.

【输入】
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

题目链接：https://vjudge.net/problem/POJ-1328

代码如下：

#include <iostream>
#include <algorithm>
#include <cmath>
using namespace std;
static const int MAXN=1000;
struct Node{
    int x,y;
    double l,r;
}island[MAXN+10];
bool cmp(Node p,Node q)
{
    if(p.l==q.l)
        return p.r<q.r;
    return p.l<q.l;
}
int main()
{
    std::ios::sync_with_stdio(false);
    std::cin.tie(0),cout.tie(0);
    int n,d,kase=0;
    while(cin>>n && n)
    {
        cin>>d;
        bool flag=false;
        for(int i=1;i<=n;i++)
        {
            cin>>island[i].x>>island[i].y;
            if(island[i].y>d)
                flag=true;
            island[i].l=island[i].x-sqrt(d*d-island[i].y*island[i].y);
            island[i].r=island[i].x+sqrt(d*d-island[i].y*island[i].y);
        }
        if(flag)
        {
            cout<<"Case "<<++kase<<": "<<-1<<endl;
            continue;
        }
        sort(island+1,island+n+1,cmp);
        int ans=1;
        double pos=island[1].r;
        for(int i=2;i<=n;i++)
            if(island[i].l>pos)
            {
                ans++;
                pos=island[i].r;
            }
            else pos=min(pos,island[i].r);
        cout<<"Case "<<++kase<<": "<<ans<<endl;
    }
    return 0;
}