poj_2485

题目链接：http://poj.org/problem?id=2485

题目大意：求最小生成树中的最大边。用下模板即可。

#include<stdio.h>
#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
#include<iomanip>
#include<vector>
#include<time.h>
#include<queue>
#include<stack>
#include<iterator>
#include<math.h>
#include<stdlib.h>
#include<limits.h>
#include<map>
//#define ONLINE_JUDGE
#define eps 1e-8
#define INF 0x7fffffff
#define FOR(i,a) for((i)=0;i<(a);(i)++)
#define MEM(a) (memset((a),0,sizeof(a)))
#define sfs(a) scanf("%s",a)
#define sf(a) scanf("%d",&a)
#define sfI(a) scanf("%I64d",&a)
#define pf(a) printf("%d\n",a)
#define pfI(a) printf("%I64d\n",a)
#define pfs(a) printf("%s\n",a)
#define sfd(a,b) scanf("%d%d",&a,&b)
#define sft(a,b,c)scanf("%d%d%d",&a,&b,&c)
#define for1(i,a,b) for(int i=(a);i<b;i++)
#define for2(i,a,b) for(int i=(a);i<=b;i++)
#define for3(i,a,b)for(int i=(b);i>=a;i--)
#define MEM1(a) memset(a,0,sizeof(a))
#define MEM2(a) memset(a,-1,sizeof(a))
const double PI=acos(-1.0);
template<class T> T gcd(T a,T b){return b?gcd(b,a%b):a;}
template<class T> T lcm(T a,T b){return a/gcd(a,b)*b;}
template<class T> inline T Min(T a,T b){return a<b?a:b;}
template<class T> inline T Max(T a,T b){return a>b?a:b;}
using namespace std;
#define ll __int64
int n,m;
#define Mod 1000000007
#define N 1010
#define M 1000010
int path[N][N];
int dis[N];
int vis[N];
void Prim(){
	memset(vis,0,sizeof vis);
	for(int i=0;i<n;i++)
		dis[i] = path[0][i];
	int ans = -INF;
	for(int i=0;i<n;i++){
		int mmin = INF;
		int flag = -1;
		for(int j=0;j<n;j++)
			if(!vis[j]&&dis[j]<mmin)
				mmin = dis[flag=j];
		if(flag == -1) break;
		vis[flag] = 1;
		if(ans<mmin)
			ans = mmin;
		for(int j=0;j<n;j++)
			if(!vis[j] && path[flag][j]<dis[j])
				dis[j] = path[flag][j];
	}
	printf("%d\n",ans);
}
int main(){
#ifndef ONLINE_JUDGE
    freopen("in.txt","r",stdin);
//  freopen("out.txt","w",stdout);
#endif
    int t;
    sf(t);
    while(t--){
    	sf(n);
    	int x;
    	for(int i=0;i<n;i++)
    		for(int j=0;j<n;j++){
    			sf(x);
    			path[i][j] = x;
    	 }
    	Prim();
    }
return 0;
}