|Tyvj|图论最小生成树|P1831 繁忙的都市

http://tyvj.cn/p/1831

用Kruskal求最小生成树，第一个问题答案是n-1，第二个问题答案即为最后加入并查集的那一条边的权值。

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
//一些定义 
struct edge{
	int x;
	int y;
	int v;
}points[10005];//边 
int n,m;
int num = 0;//边数
int father[305];//并查集 
//并查集基本操作 
int find(int x)
{
	if (father[x]!=x)father[x] = find(father[x]);
	return father[x];
}
int merge(int x, int y)
{
	int r1 = find(x);
	int r2 = find(y);
	father[r2] = r1;
}
//快速排序
int qs(int l, int r)
{
	int i = l, j = r, x = points[(l+r)/2].v;
	do{
		while(points[i].v<x) i++;
		while(points[j].v>x) j--;
		if (i<=j)
		{
			int t = points[i].v;
			points[i].v = points[j].v;
			points[j].v = t;
			t = points[i].x;
			points[i].x = points[j].x;
			points[j].x = t;
			t = points[i].y;
			points[i].y = points[j].y;
			points[j].y = t;
			i++, j--;
		}
	} while(i<=j);
	if (l<j) qs(l,j);
	if (i<r) qs(i,r);
}
int main () 
{ 
	scanf("%d%d", &n, &m);
	for (int i=1;i<=n;i++) father[i] = i;
	for (int i=1;i<=m;i++)
	{
		int u,v,c;
		scanf("%d%d%d", &u, &v, &c);
		num++;
		points[num].x = u;
		points[num].y = v;
		points[num].v = c;
	}
	qs(1, num);
	int cnt = 0;
	for (int i=1;i<=num;i++)
	{
		if (find(points[i].x)!=find(points[i].y))
		{
			merge(points[i].x, points[i].y);
			cnt++;
			if (cnt==n-1)
			{
				printf("%d %d", n-1, points[i].v);
				break;
			}
		}
	}
	return 0;
}