bzoj1083（kruskal）

题目链接：https://www.lydsy.com/JudgeOnline/problem.php?id=1083

思路：最小生成树裸题

#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <bitset>
#include <cmath>
#include <cctype>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <queue>
#include <map>
#include <set>
#include <sstream>
#include <iomanip>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const ll inff = 0x3f3f3f3f3f3f3f3f;
#define FOR(i,a,b) for(int i(a);i<=(b);++i)
#define FOL(i,a,b) for(int i(a);i>=(b);--i)
#define REW(a,b) memset(a,b,sizeof(a))
#define inf int(0x3f3f3f3f)
#define si(a) scanf("%d",&a)
#define sl(a) scanf("%lld",&a)
#define sd(a) scanf("%lf",&a)
#define ss(a) scanf("%s",a)
#define mod ll(998244353)
#define pb push_back
#define eps 1e-6
#define lc d<<1
#define rc d<<1|1
#define Pll pair<ll,ll>
#define P pair<int,int>
#define pi acos(-1)
struct as{
int u,v,d;}a[100008];
int n,m,fa[308],ans;
bool cmp(as a,as b) {return a.d<b.d;}
int fid(int x)
{
	int a=x,b;
	while(fa[a]!=a) a=fa[a];
	while(x!=a) b=fa[x],fa[x]=a,x=b;
	return a;
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    cin>>n>>m;
    FOR(i,1,n) fa[i]=i;
    FOR(i,1,m) si(a[i].u),si(a[i].v),si(a[i].d);
    sort(a+1,a+m+1,cmp);
    FOR(i,1,m)
    {
        if(fid(a[i].u)!=fid(a[i].v)) fa[fid(a[i].u)]=fid(a[i].v),ans=a[i].d;
    }
    cout<<n-1<<" "<<ans<<endl;
    return 0;
}