poj1328解题报告

Radar Installation

Time Limit: 1000MS		Memory Limit: 10000K
Total Submissions: 54665		Accepted: 12314

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

源代码

#include<iostream>
#include<cmath>
#include<algorithm>
using namespace std;
struct Node
{
     double left,right;
};
Node p[2010],temp;
bool operator < (Node a, Node b)  
{  
    return a.left < b.left;  
}  
int main()
{
    int n,i,t=0;
	double r,a,b;
	while (cin>>n>>r && (n || r))
	{
	    int flag=0;
		for (i=0;i<n;i++)
		{
		    cin>>a>>b;
			if (b>r)
			{
			    flag=1;
			}
			else 
			{
			     p[i].left=a*1.0-sqrt(r*r-b*b);
				 p[i].right=a*1.0+sqrt(r*r-b*b);
			}
		}
		t++;
		cout<<"Case "<<t<<": ";
		if (flag==1)
		{
		    cout<<-1<<endl;
		}
		else 
		{
		    int count=1;
			sort(p,p+n);
            temp=p[0];
			for (i=1;i<n;i++)
			{
			    if (p[i].left>temp.right)
				{
				     count++;
					 temp=p[i];
				}
				else if (p[i].right<temp.right)
				{
				     temp=p[i];
				}
			}
			cout<<count<<endl;
		}
	}
	return 0;
}

本题题意：给出几个岛的坐标，但是岛的纵坐标不能为负值，要求求出几个雷达，以相同的半径值，用最少的数量把这些岛全部覆盖，我的做法是参照网上某位大神的做法，其做法的大概意思就是，先将所有岛的坐标，以其为圆心做以给出半径的值画圆，与x的轴的焦点全部存下来，再以右边焦点为圆心，以给出的半径画圆，其与x轴的焦点就是可能出现的雷达最优点，再根据那些点，以其为半径画圆看能用最少几个点包括所有岛，用了贪心算法，先将包括岛屿最多的雷达点记下来，再看哪些雷达是能够把剩余岛屿也包括下来的，逐步往下推，最终得到最少雷达数，若大家看了讲法没懂，可以百度看那位大神的讲法，他还画了图更为详细。