南阳理工 贪心 287 区间选点

Radar

时间限制： 1000 ms  |  内存限制： 65535 KB

难度： 3

描述

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

分析：

贪心的三大数学模型，直到今天算是搞清楚了，区间选点，区间覆盖，选择不相交区间；无论怎样都理解了！

希望以后可以灵活运用，再多联系几道，争取熟练。

01. #include<stdio.h>

02. #include<math.h>

03. #include<algorithm>

04. using namespace std;

05. struct S

06. {

07. double x,y;

08. }a[1010];

09. int cmp(S a,S b)

10. {

11. if(a.y==b.y)

12. return a.x<b.x;

13. else

14. return a.y<b.y;

15. }

16. int main()

17. {

18.  

19. int n,i,j=1,s;

20. double d,m,t;

21. while(scanf("%d %lf",&n,&d)&&n+d)

22. {

23. for(i=0;i<n;i++)

24. {

25. scanf("%lf %lf",&m,&t);

26. a[i].x=m-sqrt(d*d-t*t);

27. a[i].y=m+sqrt(d*d-t*t);

28. }

29. sort(a,a+n,cmp);

30. s=1;

31. double k=a[0].y;

32. for(i=1;i<n;i++)

33. if(a[i].x>k)

34. {

35. s++;

36. k=a[i].y;

37. }

38. printf("Case %d:\n%d\n",j++,s);

39. }

40. return 0;

41. }