PKU1287裸的Kruskal算法低空飘过

原题 http://poj.org/problem?id=1287

#include <stdio.h>
#include <stdlib.h>
#include <malloc.h>
#include <limits.h>
#include <ctype.h>
#include <math.h>
#include <string.h>
#include <string>
#include <algorithm>
#include <iostream>
#include <set>
#include <stack>
#include <queue>
#include <vector>
#include <deque>
using namespace std;
#define INF 9999999
#define N 55
int father[N];
struct node{
	int x;
	int y;
	int len;
}map[1300];
int m,n;

bool cmp(node a,node b){
	return a.len < b.len;
}

int find(int x){
	int r = x;
	while(father[r] != r){
		r = father[r];
	}
	int i=x,k;
	while(i != r){
		k = father[r];
		father[i] = r;
		i = k;
	}

	return r;
}

int main(){
	int i;

	while(~scanf("%d%d",&n,&m)){
		if(n == 0){
			break;
		}
		for(i=0;i<m;i++){
			scanf("%d%d%d",&map[i].x,&map[i].y,&map[i].len);
		}
		sort(map,map+m,cmp);
		memset(father,0,sizeof(father));
		for(i=1;i<=n;i++){
			father[i] = i;
		}
		int ans=0;
		for(i=0;i<m;i++){
			int f1 = find(father[map[i].x]);
			int f2 = find(father[map[i].y]);
			if(f1 != f2){
				father[f1] = f2;
				ans+=map[i].len;
			}
		}
		printf("%d\n",ans);
	}

	return 0;
}