bzoj1083: [SCOI2005]繁忙的都市

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define rep(i,n) for(int i=1;i<=n;i++)
#define clr(x,c) memset(x,c,sizeof(x))
#define REP(i,s,t) for(int i=s;i<=t;i++)
int read(){
	int x=0;char c=getchar();
	while(!isdigit(c)) c=getchar();
	while(isdigit(c)) x=x*10+c-‘0‘,c=getchar();
	return x;
}
const int nmax=305;
const int maxn=90005;
const int inf=0x7f7f7f7f;
struct edge{
	int from,to,dist;
	bool operator<(const edge&rhs)const{
	  return dist<rhs.dist;}
};
edge edges[maxn<<1];
int fa[nmax];
int find(int x){
	return fa[x]==x?x:fa[x]=find(fa[x]);
}
int main(){
	int n=read(),m=read(),u,v,d;
	rep(i,m) edges[i].from=read(),edges[i].to=read(),edges[i].dist=read();
	sort(edges+1,edges+m+1);
	rep(i,n) fa[i]=i;
	int ans=-1;
	rep(i,m) {
		int ta=find(edges[i].from),tb=find(edges[i].to);
		if(ta!=tb) fa[ta]=tb,ans=max(ans,edges[i].dist);
	}
	printf("%d %d\n",n-1,ans);
	return 0;
}