最优比率生成树prime AcWing348

#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define mem(a, b) memset(a,b,sizeof(a))
#define INF 0x3f3f3f3f
#define DBG printf("this is a input\n")
#define fi first
#define se second
#define mk(a, b) make_pair(a,b)
#define p_queue priority_queue

ll gcd(ll a, ll b) {
    return b == 0 ? a : gcd(b, a % b);
}

ll lcm(ll a, ll b) {
    return a / gcd(a, b) * b;
}
int n, tot;
struct po{
    double x , y, h;
}point[1010];
struct e
{
    int u, v;
    double cost, val;
    double w;
    bool operator < (const e& no) const{
        return  w < no.w;
    }
}edge[1010];
double dp[1010];
int vis[1010];
double dis(double x1, double y1 , double x2, double y2) {
    return sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2));
}
bool prime(double R)
{
    for(int i = 1 ; i <= n ; i ++)
        dp[i] = 10000001.0;
    mem(vis,0);
    double sum = 0.0;
    dp[1] = 0.0;
    for(int i = 1 ; i <= n ; i ++)
    {
        int index = 1;
        double minn = INF;
        for(int j = 1 ; j <= n ; j ++)
        {
            if(dp[j] < minn && !vis[j])
            {
                minn = dp[j];
                index = j;
            }
        }
        vis[index] = 1;
        sum += minn;
        for(int j = 1 ; j <= n ; j ++)
        {
            double cost = dis(point[index].x, point[index].y, point[j].x, point[j].y);
            double h = fabs(point[index].h - point[j].h);
            if(!vis[j] && dp[j] > h - cost*R + 1e-6) {
                dp[j] = h - cost * R;
            }
        }
    }
    if(sum < 0.0) //最小 反之最大
        return true;
    return false;
}
int main(void)
{
    while(~scanf("%d",&n),n) {
        tot = 1;
        for (int i = 1; i <= n; i++)
            scanf("%lf %lf %lf",&point[i].x,&point[i].y,&point[i].h);
        double l = 0.0, r = 10000001.0;
        for (int i = 1; i <= 40; i++) {
            double mid = (l + r) / 2.0;
            if ((prime (mid)))
                r = mid;
            else
                l = mid;
        }
        printf("%.3lf\n", r);
    }
}