POJ 1328 Radar Installation

首先说一下很惭愧这道题不是我自己想出来的，是zhengnan同学告诉我的，我在这里写下来便于以后的查看与复习。图也是抄袭的。。。原稿http://blog.csdn.net/zhengnanlee/article/details/9613161

原稿叙述的很好我就不赘述了啊，只在这里贴代码了啊。。。。

#include <stdio.h>
#include <string.h>
#include <cmath>
#include <algorithm>
#include <stdlib.h>
#include <iostream>


using namespace std;

struct point
{
    double left, right;
} f[1010], temp;
bool operator < (point a, point b)
{
    return a.left < b.left;
}
int main()
{
    int count, i, num, t;
    double x, y, d;
    int flat;
    num = 1;
    while(~scanf("%d %lf",&t, &d) && (t || d))
    {
        count = 1;
        flat = 0;
        for(i = 0; i < t; i++)
        {
            scanf("%lf %lf",&x, &y);
            if(abs(y) > d)
                flat = 1;
            else
            {
                f[i].left = x*1.0 - sqrt(d*d-y*y);
                f[i].right = x*1.0 + sqrt(d*d-y*y);
            }
        }
        printf("Case %d: ",num++);
        if(flat == 1)
            printf("-1\n");
        else
        {
            sort(f , f+t);
            temp = f[0];
            for(i = 1; i < t; i++)
            {
                if(f[i].left > temp.right)
                {
                    count++;
                    temp = f[i];
                }
                else if(f[i].right < temp.right)
                {
                    temp = f[i];
                }
            }
            printf("%d\n",count);
        }
    }
}