题目链接:
http://hihocoder.com/problemset/problem/1227
解题思路:
题目大意:
平面上有m个点,要从这m个点当中找出n个点,使得包含这n个点的圆的半径(圆心为n个点当中的某一点且半径为整数)最小,同
时保证圆周上没有点。
算法思想:
唯一的坑就是当n大于m时,找不到符合题意的n个点,直接输出-1即可。。。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int N = 110;
const int INF = 2005;
struct Point{
double x,y;
Point(double x=0,double y=0):x(x),y(y){} // 构造函数,方便代码编写
}po[N];
double dis[N][N];
double dist(Point a,Point b){
return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}
int main(){
int T;
scanf("%d",&T);
while(T--){
int m,n;
scanf("%d%d",&m,&n);
for(int i = 0; i < m; i++)
scanf("%lf%lf",&po[i].x,&po[i].y);
memset(dis,0,sizeof(dis));
int ans = INF,r;
if(n > m){
printf("-1\n");
continue;
}
for(int i = 0; i < m; i++){
for(int j = i+1; j < m; j++){
dis[i][j] = dis[j][i] = dist(po[i],po[j]);
//cout<<dis[i][j]<<endl;
}
sort(dis[i],dis[i]+m);
r = (int)dis[i][n-1];
int j = n-1;
if(dis[i][j] >= r)
r += 1;
if(n < m && r >= dis[i][n])
continue;
if(ans > r)
ans = r;
}
if(ans == INF)
printf("-1\n");
else
printf("%d\n",ans);
}
return 0;
}