题目链接:https://vjudge.net/problem/POJ-2031
先计算出每两个cells之间的距离(空间距离-两站半径),如果小于0算做0,再加入边集,用Kruskal做
#include<iostream>
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
using namespace std;
const int MAXN=100+10;
const int MAXM=10000+10;
int UF[MAXN];
struct Edge
{
int u,v;
double w;
}edge[MAXM];
int tol; //初始化为0
void addedge(int u,int v,double w)
{
edge[tol].u=u;
edge[tol].v=v;
edge[tol++].w=w;
}
bool cmp(Edge a,Edge b)
{
return a.w<b.w;
}
int find(int x)
{
if(UF[x]==-1) return x;
else return UF[x]=find(UF[x]);
}
double Kruskal(int n)
{
memset(UF,-1,sizeof(UF));
sort(edge,edge+tol,cmp);
int cnt=0;
double ans=0;
for(int i=0;i<tol;i++)
{
int u=edge[i].u;
int v=edge[i].v;
double w=edge[i].w;
int t1=find(u);
int t2=find(v);
if(t1!=t2)
{
UF[t1]=t2;
ans+=w;
cnt++;
}
if(cnt==n-1) break;
}
return ans;
}
double x[MAXN],y[MAXN],z[MAXN],r[MAXN];
int main()
{
int n,m;
while(~scanf("%d",&n)&&n)
{
tol=0;
for(int i=1;i<=n;i++)
{
scanf("%lf%lf%lf%lf",&x[i],&y[i],&z[i],&r[i]);
for(int j=1;j<i;j++)
{
double d=sqrt((x[i]-x[j])*(x[i]-x[j])+(y[i]-y[j])*(y[i]-y[j])+(z[i]-z[j])*(z[i]-z[j]))-r[i]-r[j];
if(d<0.0) d=0.0;
addedge(i,j,d);
}
}
printf("%.3f\n",Kruskal(n));
}
return 0;
}