暑假集训第一周上 I Radar Installation 贪心

暑假集训第一周上 I 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
—————————————————————————————————————————
题意：
有一条海岸线，上方是大海，下方是陆地，在大海上有许多岛屿，如今想用雷达监测所有的岛屿，但是雷达只能安装到海岸线上；令x轴为海岸线，y轴正半轴为大海，y轴负半轴为陆地，在x轴上安装雷达，当所有岛屿都被监测到时，所需要的最少的雷达数量是多少，请求出这一值。
第一行给你两个数n和d，分别代表岛屿数量和雷达所能监测的半径；接下来n行给你每个岛屿的x，y坐标。
思路：
思路：以每个岛屿为圆心，雷达半径为半径作圆，求该圆与x轴的左交点和右交点；通过常识可知海岸线上的圆心在左交点和右交点之间任意一个位置都可以监视到该岛屿。
排序按照右交点从小到大排，右交点一样的按照左交点从大到小排。
有一种特殊情况就是岛屿距离x轴的最短距离大于雷达半径时，说明该岛屿无论如何也无法被监测到，输出-1。
贪心实现：

sum=1;
        t=f[0].b;
        for(i=1;i<n;i++)
        {
            if(f[i].a>t)
            {
                sum++;
                t=f[i].b;
            }
        }

————————————————————————————————————————
代码：

/*
思路：以每个岛屿为圆心，雷达半径为半径作圆，求
该圆与x轴的左交点和右交点；通过常识可知海岸线上
的圆心在左交点和右交点之间任意一个位置都可以监视
到该岛屿。
*/
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<algorithm>
#define inf 99999999
using namespace std;
struct ppp
{
    double a,b;
}f[100010];
bool cmp(ppp x,ppp y)
{
    if(x.b==y.b)
        return x.a>y.a;
    return x.b<y.b;
}
int main()
{
    int n,i,j,sum,flag,k=0;
    double d,x,y,t;
    while(~scanf("%d%lf",&n,&d))
    {
        k++;
        if(n==0&&d==0)
            break;
        sum=0;flag=1;
        for(i=0;i<n;i++)
        {
            scanf("%lf%lf",&x,&y);
            if(y>d)//岛屿距离x轴的最短距离还大于雷达半径
                flag=0;
            f[i].a=x-sqrt(d*d-y*y);//左交点
            f[i].b=x+sqrt(d*d-y*y);//右交点
        }
        if(flag==0)
        {
            printf("Case %d: -1\n",k);
            //printf("\n");
            continue;
        }
        sort(f,f+n,cmp);
        sum=1;
        t=f[0].b;
        for(i=1;i<n;i++)
        {
            if(f[i].a>t)
            {
                sum++;
                t=f[i].b;
            }
        }
        printf("Case %d: %d\n",k,sum);
        //printf("\n");
    }
    return 0;
}