POJ-2395 Out of Hay---MST最大边

题目链接：

https://vjudge.net/problem/POJ-2395

题目大意：

求MST中的最大边，和POJ-2495类似

思路：

模板直接过

#include<iostream>
#include<vector>
#include<queue>
#include<algorithm>
#include<cstring>
#include<cstdio>
#include<set>
#include<map>
#include<cmath>
using namespace std;
typedef pair<int, int> Pair;
typedef long long ll;
const int INF = 0x3f3f3f3f;
int T, n, m;
const int maxn = 2e4 + 10;
struct edge
{
    int v, u, w;
    bool operator < (const edge a)const
    {
        return w < a.w;
    }
};
edge e[maxn];
int pa[maxn];
int Find(int x)
{
    return x == pa[x] ? x : pa[x] = Find(pa[x]);//路径压缩
}
void kruskal()
{
    for(int i = 1; i <= n; i++)pa[i] = i;
    sort(e, e + m);
    int ans = 0;
    for(int i = 0; i < m; i++)
    {
        int v = e[i].v, u = e[i].u, w = e[i].w;
        int x = Find(v), y = Find(u);
        if(x != y)
        {
            pa[x] = y;
            ans = max(ans, w);
        }
    }
    cout<<ans<<endl;
}
int main()
{
    cin >> n >> m;
    for(int i = 0; i < m; i++)cin >> e[i].v >> e[i].u >> e[i].w;
    kruskal();
}