poj-3625 Building Roads kruskal

题目链接

题目大意：有n个顶点，m条边，每条边双向的，并且有一定的长度，现在要求使每个顶点连通起来，并且使总长度最短输出最大边，和边的总数，还有是这些边的情况输出

#include <stdio.h>
#include <string.h>
#include <math.h>
#include <iostream>
#include <algorithm>
using namespace std;
typedef long long LL;
const int maxn = 1005;
const int Mod = 1000000007;
const int inf = 1<<30;
int n,m,Max;
int p[maxn];
bool vis[maxn*maxn];
struct node
{
	int u,v,w;
}edge[maxn*maxn];
bool cmp( node a,node b )
{
	return a.w < b.w;
}
int find( int x )
{
	return x == p[x]?x:p[x] = find( p[x] );
}
void merge( int s )
{
	int x = find( edge[s].u );
	int y = find( edge[s].v );
	if( x != y )
	{
		p[x] = y;
		vis[s] = 1;
		Max = max( Max,edge[s].w );
	}
}
int main()
{
	#ifndef ONLINE_JUDGE   
	freopen("data.txt","r",stdin);   
	#endif
	int a,b,c = 1;
	while( scanf("%d%d",&n,&m) != EOF )
	{
		for( int i = 0; i < m; i ++ )
		{
			scanf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].w);
		}
		sort( edge,edge+m,cmp );
		for( int i = 1; i <= n; i ++ )	p[i] = i;
		Max = 0;
		memset( vis,0,sizeof(vis) );
		for( int i = 0; i < m; i ++ )
		{
			merge( i );
		}
		printf("%d\n%d\n",Max,n-1);
		for( int i = 0; i < m; i ++ )
			if( vis[i] )
				printf("%d %d\n",edge[i].u,edge[i].v);
	}
	return 0;
}