天天写算法之（最大团+二分）maximum shortest distance

地址: 点击打开链接

一直不大明白这个题目的意思。

回看

代码:

#include <cstdio>  
using namespace std;  
  
const int N = 65;  
int ans, f[N], set[N][N], a[N][N];  
  
bool dfs(int sz, int dep) {  
    if (!sz)   
        if (dep > ans) return ans = dep, 1;  
        else return 0;  
  
    for (int i = 1; i <= sz; i++) {  
        if (dep + sz - i + 1 <= ans) return 0;  
        int u = set[dep][i];  
        if (dep + f[u] <= ans) return 0;  
        int num = 0;  
        for (int j = i + 1; j <= sz; j++)  
            if (a[u][set[dep][j]])  
                set[dep + 1][++num] = set[dep][j];  
        if (dfs(num, dep + 1)) return 1;  
    }  
    return 0;  
}  
  
struct Point {  
    double x, y;  
    friend double dis(const Point &a, const Point &b) {  
        return (a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y);  
    }  
} p[N];  
  
int main() {  
    int n, m, i, j, sz;  
    while (scanf("%d%d", &n, &m) == 2) {  
        for (i = 1; i <= n; i++)  
            scanf("%lf%lf", &p[i].x, &p[i].y);  
        double l = 0, r = 20000;  
        while (r - l > 1e-4) {  
            double mid = (l + r) / 2;  
            ans = 0;  
            for (i = 1; i < n; i++)  
                for (j = i + 1; j <= n; j++)  
                    a[i][j] = a[j][i] = (dis(p[i], p[j]) >= mid * mid);  
            for (i = n; i; i--) {  
                sz = 0;  
                for (j = i + 1; j <= n; j++)  
                    if (a[i][j])  
                        set[1][++sz] = j;  
                dfs(sz, 1);  
                f[i] = ans;  
            }  
            if (ans >= m) l = mid;  
            else r = mid;  
        }  
        printf("%.2lf\n", l);  
    }  
  
    return 0;  
}