关押罪犯 （并查集）

http://wikioi.com/problem/1069/

// File Name: wiki1069.cpp
// Author: bo_jwolf
// Created Time: 2013年08月17日 星期六 16时54分27秒

#include<vector>
#include<list>
#include<map>
#include<set>
#include<deque>
#include<stack>
#include<bitset>
#include<algorithm>
#include<functional>
#include<numeric>
#include<utility>
#include<sstream>
#include<iostream>
#include<iomanip>
#include<cstdio>
#include<cmath>
#include<cstdlib>
#include<cstring>
#include<ctime>

using namespace std;
const int maxn = 100005 ;

struct node 
{
	int x , y , value ;
	bool operator<( const node x ) const 
	{
		return value > x.value ;
	}
}edge[ maxn ] ;

int fa[ maxn * 2 ] ;

int find( int x )
{
	return fa[ x ] = fa[ x ] == x ? x : find ( fa[ x ] ) ;
}

int main()
{
	int n , m ;
	while( cin >> n >> m )
	{
		for( int i = 0 ; i <= n * 2  ; ++i )
			fa[ i ] = i ;
		for( int i = 1 ; i <= m ; ++i )
		{
			cin >> edge[ i ].x >> edge[ i ].y >> edge[ i ].value ;
		}
		sort( edge + 1 , edge + m + 1) ;
		for( int i = 1 ; i <= m ; ++i )
		{
			int x = find( edge[ i ].x ) ;
			int y = find( edge[ i ].y ) ;
			if( x == y )
			{
				cout << edge[ i ].value << endl ;
				return 0 ;
			}
			fa[ y ] = find( edge[ i ].x + n )  ;
			fa[ x ] = find( edge[ i ].y + n ) ;
		}
		cout << "0" << endl ;
	}
return 0;
}