思路就是最优比率生成树+prim
主意好细节。
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (o<<1)
#define rs (o<<1|1)
#define pb push_back
const double PI= acos(-1.0);
const int M = 1e3+7;
const double eps=1e-8;
struct node{
double x,y,z;
}p[M];
double a[M][M],c[M][M];
bool v[M];
double d[M];
int n;
bool ck(double b)// 是否所有生成树都满足 sum{c}-b*sum{d} >0
{
double ans=0;
for(int i=0;i<=n+1;i++)d[i]=1e18;
memset(v,0,sizeof(v));
d[1]=0;
for(int i=1;i<=n;i++)
{
int x=0;
for(int j=1;j<=n;j++)
if(!v[j]&&(x==0||d[j]<d[x]))x=j;
v[x]=1;
ans+=d[x];
for(int j=1;j<=n;j++)
if(!v[j])d[j]=min(d[j],c[x][j]-b*a[x][j]);
}
// cout<<"========"<<ans<<endl;
if(ans+eps<=0)return true;
return false;
}
int main()
{
while(scanf("%d",&n)&&n)
{
for(int i=1;i<=n;i++)
{
double x,y,z;cin>>x>>y>>z;
p[i]=node{x,y,z};
}
for(int i=1;i<=n;i++)
for(int j=i+1;j<=n;j++)
a[i][j]=a[j][i]=sqrt((p[i].x-p[j].x)*(p[i].x-p[j].x)+(p[i].y-p[j].y)*(p[i].y-p[j].y)),
c[i][j]=c[j][i]=fabs(p[i].z-p[j].z);
double l=0,r=1e8;
while(l+eps<r)
{
double mid=(l+r)/2.0;
//printf("%lf %lf %d\n",l,r,(l+eps)<r);
if(ck(mid))r=mid;
else l=mid;
}
printf("%.3lf\n",l);
}
return 0;
}