[BZOJ1083]SCOI2005繁忙的都市|最小生成树

裸的MST。。

#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
struct edge{
	int s,e,q;
} ed[10005]; 
int i,n,m,cnt=0,fa[10005];
int getfa(int x){return fa[x]==x?x:fa[x]=getfa(fa[x]);}
bool cmp(edge a,edge b){return a.q<b.q;}
bool merge(int a,int b)
{
	int pa=getfa(a),pb=getfa(b);
	if (pa!=pb) {fa[pa]=pb,cnt++;return true;}
	return false;
}
int main()
{
	scanf("%d%d",&n,&m);
	printf("%d ",n-1);
	for (i=1;i<=n;i++) fa[i]=i;
	for (i=1;i<=m;i++)
		scanf("%d%d%d",&ed[i].s,&ed[i].e,&ed[i].q);
	sort(ed+1,ed+1+m,cmp);
	for (i=1;i<=m;i++)
		if (merge(ed[i].s,ed[i].e)&&cnt==n-1)
		{
			printf("%d",ed[i].q);
			return 0;
		}
}