poj 1328 Radar Installation

先看一下题目：

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

大体题意：

就是要装雷达检测小岛（小岛只在X轴上方存在），雷达要装在X轴（沿岸），问要能够覆盖全部小岛，至少需要装多少雷达

这样，以小岛为中心，以d为半径画圆，如果小岛的纵坐标不大于d的话，那肯定会与X轴交于两点呀，那么在这两点之间的那些点装的雷达就都可以扫描到这个小岛了呗；

以此类推，将能扫描到其他小岛的区间也分别计算出来，这样就是贪心所谓的区间调度问题了：按照每个区间的右端点排序，从第一个区间的右端点遍历（因为第一个区间的肯定是最左边的呀，没有比他更往左的了，所以选区间其他点也不能扫到其他岛了，所以就选最右端点，试看看能不能顺便扫到其他岛喽），往后就是贪心了，不再具体讲。

贪心，贪心哪！！！

做过一次了还是出现了不少错误【擦眼泪】
注意：
1.对于纵坐标大于扫描距离的点，直接返回-1
2.距离计算后应该取double类型
3.如果不使用排序，可以直接在循坏里面加判断if(t>a[i].e) t=a[i].e;
4.对于qsort（）排序，需要注意的一点
int cmp(const void *a, const void *b)（对于用'-'排序的元素，可以不用在意返回值，但是用大于号小于号排序的元素，最好是有返回值）
返回正数就是说 cmp 传入参数第一个要放在第二个后面, 负数就是传入参数第一个要放第二个前面, 如果是 0, 那就无所谓谁前谁后.
5.看看快排详解：http://blog.sina.com.cn/s/blog_6d3488c30100ogdt.html

#include <stdio h=""> #include <stdlib h=""> #include <math h=""> typedef struct Node{ double s,e; }node; node a[1005]; int cmp(const void *a,const void *b) { node *p1=(node *)a; node *p2=(node *)b;//可以直接强制类型转换返回，也可以不转 return (p1->e>p2->e)?1:-1;//此处是根据区间右端点进行排序，左端点不重要 }//对于double 类型排序一定要注意不能直接减，会导致精度缺失，因为cmp函数返回整形 int main() { int n,i,cnt,flag,j=1; double d,x,y; while(~scanf("%d%lf",&n,&d)&&n&&d) { cnt=1; flag=0; for(i=0;i<n i="" scanf="" lf="" lf="" x="" y="" if="" y="">d) flag=1; else{ a[i].s=x-sqrt(d*d-y*y); a[i].e=x+sqrt(d*d-y*y); } } if(flag) { printf("Case %d: -1\n",j++); continue; } qsort(a,n,sizeof(a[0]),cmp); double t=a[0].e; for(i=1;i<n;i++) { if(t<a[i].s) { t=a[i].e; cnt++; } } printf("Case %d: %d\n",j++,cnt); } return 0; } </n></math></stdlib></stdio>