贪心,以岛屿为圆心判断雷达范围
minum[n]为前n个岛屿最少雷达数,当第n+1个岛屿能被前面雷达探测到,minum[n+1]=minum[n],缩小雷达区间 范围,否则加1,更新雷达区间
#include<iostream>
#include <string>
#include<vector>
#include<algorithm>
#include<set>
#include<fstream>
#include<cmath>
using namespace std;
#define lch(i) ((i)<<1)
#define rch(i) ((i)<<1|1)
#define sqr(i) ((i)*(i))
#define pii pair<int,int>
#define mp make_pair
#define FOR(i,b,e) for(int i=b;i<=e;i++)
#define ms(a) memset(a,0,sizeof(a))
const int maxnum = 1005;
int minum[maxnum];
float maxX,minX;
int n,d;
struct node
{
int x,y;float left,right;
node(){}
node(int a,int b,float c,float d):x(a),y(b),left(c),right(d){}
};
vector<node> vec;
int cmp(node a,node b){
return a.left<b.left;
}
int main()
{
/*ifstream fin("G:/1.txt");*/
int x,y,flag=0,t=0;
while(1){
scanf("%d%d",&n,&d);
//fin>>n>>d;
if(n==0&&d==0)break;
flag=0;
if(d<=0)flag=1;
vec.clear();
ms(minum);
FOR(i,1,n){
scanf("%d%d",&x,&y);
//fin>>x>>y;
if(y>d)flag=1;
if(flag) continue;
float dis=sqrt(float(sqr(d)-sqr(y)));
vec.push_back(node(x,y,x-dis,x+dis));
}
if(flag)printf("Case %d: -1\n",++t);
else{
sort(vec.begin(),vec.end(),cmp);
minum[0]=0;minX=maxX = vec[0].left-1;
FOR(i,0,n-1){
if(vec[i].left<=maxX&&vec[i].right>=minX){
maxX = min(maxX,vec[i].right);
minX = max(minX,vec[i].left);
minum[i+1]=minum[i];
}else{
minum[i+1]=minum[i]+1;
maxX = vec[i].right;
minX = vec[i].left;
}
}
printf("Case %d: %d\n",++t,minum[n]);
}
}
}