题解:
- 题目很高大上,实际上就是求一课最小生成树。模板题目。最后记录树中最长的边。
代码:
#include <bits/stdc++.h>
using namespace std;
int const N = 50000 + 10;
int const M = 100000 + 10;
int const inf = 0x7f7f7f7f;
int n,m,root;
int fa[N];
struct Edge
{
int u,v,cost;
bool operator < (const Edge& e) const{
return cost < e.cost;
}
}e[M];
int find(int x){
return x == fa[x] ? x : (fa[x] = find(fa[x]));
}
int Krustkal(){
sort(e,e+m);
int num = 0, ans = 0;
for(int i=1;i<=n;i++) fa[i] = i;
for(int i=0;i<m;i++){
int x = e[i].u, y = e[i].v;
int fx = find(x), fy = find(y);
if(fx != fy){
num++;
fa[fx] = fy;
ans = max(ans,e[i].cost);
}
if(num == n - 1) break;
}
return ans;
}
int main(){
cin>>n>>m>>root;
for(int i=0;i<m;i++){
int u,v,cost;
cin>>u>>v>>cost;
e[i] = (Edge){u,v,cost};
}
cout<<Krustkal()<<endl;
return 0;
}