最小生成树（一）：Kruskal算法

https://vjudge.net/problem/POJ-1258
算法思路：
将边按边权从小到大排序
然后遍历
判断现在的边的两个端点是否在同一个连通块里
如果在就没有必要加边
如果不在
就加上 再维护连通块
（用并查集维护连通块）

时间复杂度为：ElogE

#include <iostream>
#include <cstdio>
#include <algorithm>

using namespace std;

#define LL long long

int n;
struct stu{
	int na, nb, w;
};
stu edge[50010];
int edgeNum = 0;
LL ans = 0;
int fa[110] = {0};

int read()
{
	int x = 0, w = 1;
	char ch = getchar();
	while(ch < '0' || ch > '9')
	{
		if(ch == '-') w = -1;
		ch = getchar();
	}
	while(ch <= '9' && ch >= '0')
	{
		x = x * 10 + ch - '0';
		ch = getchar();
	}
	return x * w;
}

void add_edge(int a, int b, int w)
{
	edge[++edgeNum].na = a;
	edge[edgeNum].nb = b;
	edge[edgeNum].w = w;
}

bool comp_w(stu a, stu b)
{
	return a.w < b.w;
}

int find(int x)
{
	if(fa[x] != x) fa[x] = find(fa[x]);
	return fa[x];
}

void unit(int r1, int r2)
{
	fa[r2] = r1;
}

void Krus()
{
	sort(edge + 1, edge + edgeNum + 1, comp_w);
	for(int i = 1; i <= n; i++)
	{
		fa[i] = i;
	}
	for(int i = 1; i <= edgeNum; i++)
	{
		int a = edge[i].na;
		int b = edge[i].nb;
		int w = edge[i].w;
		int r1 = find(a);
		int r2 = find(b);
		if(r1 != r2)
		{
			unit(r1, r2);
			ans += w;
		}
	}
}

int main()
{
	while(scanf("%d", &n) != EOF)
	{
		edgeNum = 0;
		ans = 0;
		for(int i = 1; i <= n; i++)
		{
			for(int j = 1; j <= n; j++)
			{
				int disNow;
				disNow = read();
				if(i >= j)
				{
					add_edge(i, j, disNow);
				}
			}
		}
		Krus();
		printf("%lld\n", ans);
	}
	
	
	
	return 0;
}