题目概述
解题思路
根据题意,这道题是要求给定的N个三维球体的最小生成树。这道题的数据特点在于:
- 点不是特别多(100以内)
- 但是每两个点之间都需要计算一下距离(E~V^2)
这就是说,我们采用邻接矩阵存储图是更好的策略。
另外,考虑到边的数目非常多,我们采用类似于Prim算法的思想来求解,即维护最小生成树的子树,每次添加未使用的节点到该子树的最小的边。
方法性能
方法的时间复杂度为O():
示例代码
#include<algorithm>
#include<cmath>
#include<math.h>
#include<stdio.h>
#include<string.h>
#include<vector>
#include<set>
using namespace std;
struct Node
{
float X, Y, Z, R;
}nodes[110];
float edges[110][110];
float min_dist[110];
float Dist(int i, int j)
{
float dis[3];
dis[0] = nodes[i].X - nodes[j].X;
dis[1] = nodes[i].Y - nodes[j].Y;
dis[2] = nodes[i].Z - nodes[j].Z;
float o_dist = sqrt(dis[0] * dis[0] + dis[1] * dis[1] + dis[2] * dis[2]) - nodes[i].R - nodes[j].R;
return o_dist > 0 ? o_dist : 0;
}
int main()
{
int Num;
while(scanf("%d", &Num) && Num)
{
for (int ni = 0; ni < Num;++ni)
scanf("%f%f%f%f", &(nodes[ni].X), &(nodes[ni].Y), &(nodes[ni].Z), &(nodes[ni].R));
memset(edges, 0, sizeof(edges));
int tree_N = 1;
//construct the adjacent matrix
for (int i = 0; i < Num; ++i)
{
for (int j = i + 1; j < Num; ++j)
{
edges[i][j] = edges[j][i] = Dist(i, j);
}
min_dist[i] = edges[0][i];
}
//Prim to find the MST
set<int> remain_node;
for (int i = 1; i < Num;++i)
remain_node.insert(i);
float sum = 0;
while (tree_N < Num)
{
float min_d = 1000;
int min_idx;
for (set<int>::iterator iter = remain_node.begin(); iter != remain_node.end(); ++iter)
{
if(min_d > min_dist[*iter])
{
min_idx = *iter;
min_d = min_dist[min_idx];
}
}
remain_node.erase(min_idx);
sum += min_d;
for (set<int>::iterator iter = remain_node.begin(); iter != remain_node.end(); ++iter)
{
if(min_dist[*iter] > edges[min_idx][*iter])
{
min_dist[*iter] = edges[min_idx][*iter];
}
}
tree_N++;
}
printf("%.3f\n", sum);
}
return 0;
}