POJ 2031

【题目分析】
最小生成树。

---

【代码】

#include <cstdio>
#include <cmath>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
int fr[10001],to[10001],rank[10001],f[101];
double w[10001],x[101],y[101],z[101],r[101],ans=0;
int n,en=0;
inline int gf(int k)
{if (f[k]==k) return k;else return f[k]=gf(f[k]);}
inline bool cmp(int a,int b)
{return w[a]<w[b];}
inline double dis(double x1,double y1,double z1,double r1,double x2,double y2,double z2,double r2)
{return max(0.0,sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2)+(z1-z2)*(z1-z2))-r1-r2);}
int main()
{
    while (scanf("%d",&n)!=EOF&&n)
    {
        ans=0;
        en=0;
        for (int i=1;i<=n;++i) scanf("%lf%lf%lf%lf",&x[i],&y[i],&z[i],&r[i]);
        for (int i=1;i<n;++i)
            for (int j=i+1;j<=n;++j)
            {
                ++en;
                fr[en]=i;
                to[en]=j;
                w[en]=dis(x[i],y[i],z[i],r[i],x[j],y[j],z[j],r[j]);
            }
        for (int i=1;i<=en;++i) rank[i]=i;
        sort(rank+1,rank+en+1,cmp);
        for (int i=1;i<=n;++i) f[i]=i;
        for (int i=1;i<=en;++i)
        {
            int l=fr[rank[i]],r=to[rank[i]];
            int fl=gf(l),fr=gf(r);
            if (fl!=fr)
            {
                ans+=w[rank[i]];
                f[fl]=fr;
            }
        }
        printf("%.3f\n",ans);
    }
}