POJ 1328题目大意如下:
给出N座小岛的坐标,以及灯塔的观察半径,需要建造最小数目的灯塔,使得所有的小岛都能在灯塔的观察范围之内
这个问题可以换角度思考,因为已经知道小岛的坐标以及观察半径,所以可以算出以小岛为圆心,观察半径为半径的圆与海岸线的交点的横坐标,同时对每一个这样圆,记录酸楚的以两个横坐标(可以相等,也可以不相等)为上下限的区间,然后暴力穷竭解决:
#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cmath>
#include <map>
#include <utility>
using namespace std;
const int maxn = 1000;
struct Cor {
int x, y;
}island[maxn + 1];
int N, D;
pair<double, double> section[maxn + 1];
bool comp(const pair<double, double>& lhs, const pair<double, double>& rhs) {
return lhs.first < rhs.first || (lhs.first == rhs.first & lhs.second < rhs.second);
}
void solve(int CaseTime) {
int sum = 1;
for (int i = 0; i < N; i++) {
if (abs(island[i].y) > D) {
printf("Case %d: -1\n", CaseTime);
return ;
}
else {
double delta = D*D - island[i].y*island[i].y;
section[i].first = island[i].x*1.0 - sqrt(delta);
section[i].second = island[i].x*1.0 + sqrt(delta);
}
}
sort(section, section + N, comp);
pair<double, double> temp = section[0];
for (int i = 1; i < N; i++) {
if (section[i].first > temp.second) {
sum++;
temp = section[i];
}
else if (temp.second >= section[i].second) temp = section[i];
}
printf("Case %d: %d\n", CaseTime, sum);
}
int main(int argc, const char * argv[]) {
// insert code here...
int CaseTime = 1;
while (scanf("%d %d", &N, &D) && (N != 0 && D != 0)) {
for (int i = 0; i < N; i++) {
scanf("%d %d", &island[i].x, &island[i].y);
}
solve(CaseTime);
CaseTime++;
}
return 0;
}