贪心建雷达

Description

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.

Sample Input

3 2
1 2
-3 1
2 1

1 2
0 2

0 0

Sample Output

Case 1: 2
Case 2: 1

代码：

#include <stdio.h>
#include <algorithm>
#include <cmath>
#include <string.h>
#include <iostream>
int main()
{
    int n,j,i,num=1,m=0,flag=1;
    double b[1010][2],t,time,x[1010][2],r;
    while(scanf("%d %lf",&n,&r),n&&r)
    {
        for(i=0; i<n; i++)
            scanf("%lf %lf",&x[i][0],&x[i][1]);
        for(i=0; i<n; i++)
        {
            b[i][0]=x[i][0]-sqrt((r*r-x[i][1]*x[i][1]));
            b[i][1]=x[i][0]+sqrt((r*r-x[i][1]*x[i][1]));
        }


        for(i=0; i<n-1; i++)
            for(j=i+1; j<n; j++)
                if(b[i][1]>b[j][1])
                {
                    t=b[i][0];
                    b[i][0]=b[j][0];
                    b[j][0]=t;
                    t=b[i][1];
                    b[i][1]=b[j][1];
                    b[j][1]=t;
                }


         flag=1;
        num=1;
        time=b[0][1];
        for(i=1; i<n; i++)
        {
            if(time<b[i][0])      //这里是小于，不是小于等于。和活动时间排序那题不一样。
            {
                time=b[i][1];
                num++;
            }
        }
        m++;
        for(i=0;i<n;i++)
        {
            if(x[i][1]>r)
                {printf("Case %d: -1\n",m);
                flag=0;
            break;
               }
        }
           if(flag==1) printf("Case %d: %d\n",m,num);
    }
    return 0;
}