最优比率生成树

也就是01规划问题，用实数二分就可以解决。主要问题是使用克鲁斯卡尔算法会tle。。。（稠密图）

#include<bits/stdc++.h>
#define INF 0x3f3f3f3f
using namespace std;

int n;
int fa[1002];
struct node{
    double x,y,z;
}a[1002];

struct mode{
   int  x; int y;
   double z;
};
int get(int x)
{
	if(x == fa[x]) return x;
	return fa[x] = get(fa[x]);
}

double d[1002][1002];
double h[1002][1002];

bool cmp(mode a,mode b)
{
    return a.z < b.z;
}
double s(double x1,double x2,double y1,double y2 )
{
    return sqrt(1.0 *(x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2));
}

double  kruskal(vector<mode> edge)
{
    double ans = 0;
    sort(edge.begin(),edge.end(),cmp);
    for(int i = 1 ; i <= n ; i++) fa[i]  = i;
    for(int i = 0 ; i < edge.size() ; i++)
    {
        int x = get(edge[i].x) , y = get(edge[i].y);
        if(x == y) continue;
        fa[x] = y;
        ans += edge[i].z;
    }
    return ans;
}
double check(double mid)
{
       

      
       vector<mode> edge;
       for(int i = 1; i <= n ; i++)
       {
           for(int j = i + 1;  j <= n ; j++)
           {
           
                 edge.push_back({i,j,h[i][j] - mid *  d[i][j]}) ;  
             
           }
       }
   
   
        return kruskal(edge);
       
}

int main()
{
   
    while(scanf("%d",&n) && n != 0)
    {
        double num = 0;
        for(int i = 1 ; i <= n ; i++) cin >> a[i].x >> a[i].y >> a[i].z;
        
        for(int i = 1; i <= n ; i++)
        {
            for(int j = 1 ; j <= n ;j++)
            {
                if(i == j)continue;
                d[i][j] = d[j][i]= s(a[i].x,a[j].x,a[i].y,a[j].y);
                num +=( h[i][j] = h[j][i] = abs(a[i].z - a[j].z));
            }
        }
        
        double l = 0 , r = 1e9;
        while(r - l >= 0.000001)
        {
            double mid = (l + r) * 0.5;
           if(check(mid) >= 0) l = mid;
            else r = mid;
        }
        printf("%.3f\n",l );
        
        
    }
    
    
    return 0;
}