题意:n个点中找k个点使得它们最短距离最长。
思路:二分,二分这个距离。(如果一条边的长度>=这个距离,就可以连边。)然后看看最大团的大小,比k大还是比k小。
http://acm.hdu.edu.cn/showproblem.php?pid=3585
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <cmath>
#include <ctime>
#include <string>
#include <cstdio>
#include <vector>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#define rep(i,a,b) for(int i = (a) ; i <= (b) ; i ++)
#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)
#define repS(it,p) for(auto it = p.begin() ; it != p.end() ; it ++)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x) memset(a,x,sizeof(a))
#define eps 1e-8
using namespace std;
const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 55;
const int MAXE = 2e5+5;
typedef long long LL;
typedef unsigned long long ULL;
int T,n,m;
int fx[] = {0,1,-1,0,0};
int fy[] = {0,0,0,-1,1};
struct Point {
double x,y;
double dist(const Point & B) const {
return sqrt((x-B.x) * (x-B.x) + (y-B.y) * (y-B.y));
}
}A[MAXN];
double M[MAXN][MAXN];
int dp[MAXN];
int best;
bool dfs(int * id,int top,int cnt,double r) {
if(!top) {
if(best < cnt) {
best = cnt ;
return true;
}
return false;
}
int a[MAXN];
rep(i,1,top) {
if(cnt+top-i+1<=best) return false;
if(cnt+dp[id[i]]<=best) return false;
int lan = 0;
rep(j,i+1,top) if(M[id[i]][id[j]] >= r) a[++lan] = id[j];
if(dfs(a,lan,cnt+1,r)) return true;
}
return false;
}
int max_clique(double r) {
int id[MAXN];
best = 0;
rrep(i,1,n) {
int top = 0;
rep(j,i+1,n) if(M[i][j] >= r) id[++top] = j;
dfs(id,top,1,r);
dp[i] = best;
}
return best;
}
int k;
void debug() {
rep(i,1,n) {
rep(j,1,n) printf("%f ",M[i][j]);
puts("");
}
}
void input() {
rep(i,1,n) scanf("%lf %lf",&A[i].x,&A[i].y);
}
void solve() {
rep(i,1,n) rep(j,1,n) M[i][j] = A[i].dist(A[j]);
double l = 0 ;
double r = 20000;
while(fabs(l-r)>eps) {
double mid = (l + r) / 2;
if(max_clique(mid) >= k) l = mid;
else r = mid;
}
printf("%.2f\n",l);
}
int main(void) {
while(~scanf("%d %d",&n,&k)) {
input();
solve();
}
return 0;
}