大体题意:
给出一个n(n <= 100)结点的图,求苗条度(最大边减最小边的值)尽量小的生成树!
思路:
直接枚举 起点, 然后从起点开始构造最小生成树,构造好了 就更新答案,ans = min(ans,w[r]-w[l])!
每枚举一次起点 就要刷新一下并查集!
详细见代码:
#include<cstdio>
#include<cstring>
#include<algorithm>
#include<cmath>
#include<cstdlib>
#include<vector>
#include<set>
#include<map>
#include<stack>
#include<cctype>
#include<string>
#include<iostream>
#include<queue>
#define fout freopen("out.txt","w",stdout);
#define mr make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef unsigned long long LLU;
const int maxn = 10000 + 5;
const int mod = 1000000000;
const double eps = 1e-8;
const int inf = 0x3f3f3f3f;
struct Node{
int x,y,d;
void read(int xx,int yy,int dd){
x = xx; y = yy; d = dd;
}
bool operator < (const Node & rhs) const {
return d < rhs.d;
}
}p[maxn];
int fa[maxn];
int n, m;
int find(int x){
return fa[x] == x ? x : fa[x] = find(fa[x]);
}
int solve(){
int ans = inf;
for (int l = 0; l < m; ++l){
for (int i = 0; i <= n; ++i)fa[i] = i;
int cnt = n;
for (int r = l; r < m; ++r){
int x = find(p[r].x);
int y = find(p[r].y);
if (x != y){
fa[x] = y;
--cnt;
}
if (cnt == 1){
ans = min(ans,p[r].d - p[l].d);
break;
}
}
}
return ans;
}
int main(){
while(scanf("%d %d",&n,&m) == 2 && (n || m)){
for (int i = 0; i <= n; ++i)fa[i] = i;
for (int i = 0; i < m; ++i){
int u,v,w;
scanf("%d %d %d",&u,&v,&w);
p[i].read(u,v,w);
}
sort(p,p+m);
int ans = solve();
printf("%d\n",ans == inf ? -1 : ans);
}
return 0;
}