算法:图论,贪心,并查集,排序,二分图
代码:
#include <cstdio>
#include <algorithm>
using namespace std;
struct data{
int x;
int y;
int z;
}f[100005];
int n,m,fa[20005],b[20005],i;
bool cmp(data a,data b){
return a.z>b.z;
}
int find(int x){
if(fa[x]==x) return x;
return fa[x]=find(fa[x]);;
}
void ad(int x,int y){
x=find(fa[x]);
y=find(fa[y]);
fa[x]=y;
}
bool check(int x,int y){
x=find(x);
y=find(y);
if(x==y) return 1;
return 0;
}
int main(){
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++) fa[i]=i;
for(i=1;i<=m;i++)
scanf("%d%d%d",&f[i].x,&f[i].y,&f[i].z);
sort(f+1,f+m+1,cmp);
for(i=1;i<=m+1;i++){
if(check(f[i].x,f[i].y)){
printf("%d",f[i].z);
return 0;
}
else{
if(!b[f[i].x]) b[f[i].x]=f[i].y;
else ad(b[f[i].x],f[i].y);
if(!b[f[i].y]) b[f[i].y]=f[i].x;
else ad(b[f[i].y],f[i].x);
}
}
return 0;
}