题目链接
由于:最小生成树中的最大边一定是所有生成树中最小的
故:枚举每个边, 对于每个边,以其为生成树的最小边Kruscal做生成树,求出该生成树的极差并更新
AC代码
#include<bits/stdc++.h>
using namespace std;
const int maxn = 105;
const int maxm = 5000;
int n, m, fa[maxn];
struct edge{
int u, v, w;
}e[maxm];
bool cmp(edge a, edge b){
return a.w < b.w;
}
int get(int a){
if(a == fa[a])
return a;
return fa[a] = get(fa[a]);
}
bool sam(int a, int b){
if(get(a) == get(b))
return true;
return false;
}
void merge(int a, int b){
if(sam(a, b))
return ;
fa[get(a)] = get(b);
}
int kruscal(int a){
int cnt = n, tmax = -1;
for(int i = 1; i <= n; i++)
fa[i] = i;
for(int i = a; i < m; i++){
if(!sam(e[i].u, e[i].v) && e[i].w >= e[a].w){
merge(e[i].u, e[i].v);
cnt--;
if(e[i].w > tmax)
tmax = e[i].w;
if(cnt == 1)
break;
}
}
if(cnt == 1 && tmax != -1)
return tmax - e[a].w;
return 0x3f3f3f3f;
}
int main(){
cin>>n>>m;
int a, b, c, minm = 0x3f3f3f3f;
for(int i = 0; i < m; i++){
scanf("%d%d%d", &a, &b, &c);
e[i].u = a, e[i].v = b, e[i].w = c;
}
sort(e, e + m, cmp);
for(int i = 0; i < m; i++){
minm = min(kruscal(i), minm);
}
if(minm == 0x3f3f3f3f)
cout<<-1<<endl;
else
cout<<minm<<endl;
return 0;
}