UVa 10034 - Freckles

题目：给你平面上的n个点，求把他们连在一起的最小代价。

分析：图论，最小生成树。直接计算出所有点之间的距离，然后计算最小生成树即可。

注意：每组数据之间有空行。

#include <algorithm>
#include <iostream>
#include <cstdlib>
#include <cstdio>
#include <cmath>

using namespace std;

typedef struct d_node
{
	int    point1;
	int    point2;
	double weight;
}enode;
enode edge[20302];

//union_set
int sets[105];
int rank[105];

void set_inital( int a, int b )
{
	for ( int i = a ; i <= b ; ++ i ) {
		rank[i] = 0;
		sets[i] = i;
	}
}

int  set_find( int a )
{
	if ( a != sets[a] )
		sets[a] = set_find( sets[a] );
	return sets[a];
}

void set_union( int a, int b )
{
	if ( rank[a] < rank[b] )
		sets[a] = b;
	else {
		if ( rank[a] == rank[b] )
			rank[a] ++;
		sets[b] = a;
	}
}
//end_union_set

int cmp_e( enode a, enode b )
{
	return a.weight < b.weight;
}

double kruskal( int n, int m )
{
	sort( edge, edge+m, cmp_e );
	
	set_inital( 0, n );
	double sum = 0.0;
	for ( int i = 0 ; i < m ; ++ i ) {
		int A = set_find( edge[i].point1 );
		int B = set_find( edge[i].point2 );
		if ( A != B ) { 
			set_union( A, B );
			sum += edge[i].weight+0LL;
		}
	}
	return sum;
}

typedef struct pnode
{
	double x,y;
}point;
point p[105];

double dist( point a, point b )
{
	return sqrt((a.x-b.x)*(a.x-b.x)+(a.y-b.y)*(a.y-b.y));
}

int main()
{
	int t,n,c = 0;
	while ( cin >> t )
	while ( t -- ) {
		cin >> n;
		for ( int i = 0 ; i < n ; ++ i ) 
			cin >> p[i].x >> p[i].y;
		
		int e_count = 0;
		for ( int i = 0 ; i < n ; ++ i )
		for ( int j = i+1 ; j < n ; ++ j ) {
			edge[e_count].point1 = i;
			edge[e_count].point2 = j; 
			edge[e_count].weight = dist( p[i], p[j] );
			e_count ++;
		}
		if ( c ++ ) printf("\n");
		printf("%.2lf\n",kruskal( n, e_count ));
	}
	
	return 0;
}