POJ 2031

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<iostream>
using namespace std;
#define inf 0x7f7f7f7f
double map[110][110], dis[110], x[110], y[110], z[110], r[110];
int book[110];
int main()
{
	int n, i, j, u, v;
	double sum, t, f, min;
	while (cin >> n)
	{
		if (n == 0)
			break;
		for (i = 1;i <= n;i++)
			cin >> x[i] >> y[i] >> z[i] >> r[i];
		memset(map, 0, sizeof(map));
		for (i = 1;i <= n;i++)
			for (j = 1;j <= n;j++)
			{
				t = (double)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]));
				f = r[i] + r[j];
				if (t > f)
				{
					map[i][j] = t - f;
					map[j][i] = t - f;
				}
				else
				{
					map[i][j] = 0;
					map[j][i] = 0;
				}
			}
		for (i = 1;i <= n;i++)
			dis[i] = map[1][i];
		memset(book, 0, sizeof(book));
		book[1] = 1;
		sum = 0.0;
		for (i = 1;i < n;i++)
		{
			min = inf;
			for (j = 1;j <= n;j++)
			{
				if (book[j] == 0 && dis[j] < min)
				{
					min = dis[j];
					u = j;
				}
			}
			book[u] = 1;
			sum = sum + dis[u];
			for (v = 1;v <= n;v++)
			{
				if (book[v] == 0 && dis[v] > map[u][v])
					dis[v] = map[u][v];
			}
		}
		printf("%.3f\n", sum);
	}
}

就是先算出每个球于球之间的距离，然后从随意一个开始找，并对开始的标记，然后从开始的那个找到其距离最短的那个，然后对那个标记，从找到的那个开始继续找距离最短的未标记的，重复，直到所有球都标记了，就是最短的距离了。
懂了就是水题，不懂就是做不出来的题。