uva-1395

https://vjudge.net/problem/uva-1395

题意： 给出一个图，求使得一棵生成树的最大边和最小边相差最小的那棵生成树，得出这个最小的相差值；

思路： 参考大白：先排个序，然后枚举这生成树的最小的那个边，直到能够形成生成树，得出差值，然后进行比较输出；

#include<iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<queue>
#include<algorithm>

using namespace std;
typedef long long ll;
const int maxn = 10000 + 10;
int n,m;
struct Node
{
	int x,y,z;
}a[maxn];
bool cmp(const Node &x,const Node &y)
{
	return x.z < y.z;
}
int fa[maxn];
void Init()
{
	for(int i = 0; i< maxn; i ++)
	fa[i] = i;
}
int finds(int x)
{
	return x == fa[x] ? x : (fa[x] = finds(fa[x]));
}
int kruskal(int sta)
{
	Init();
	int cnt = 0;
	for(int i = sta; i <= m; i ++)
	{
		int x = finds(a[i].x),y = finds(a[i].y);
		if(x != y)
		{
			fa[x] = y;
			cnt ++;
		}
		if(cnt == n - 1)
		{
//			cout << sta << " Pass _ by " << i << endl;
			return a[i].z - a[sta].z;
		}
	}
	return 10e8;
}
int main()
{
	while( ~ scanf("%d%d",&n,&m) && n)
	{
		for(int i = 1; i <= m; i ++)
		{
			scanf("%d%d%d",&a[i].x,&a[i].y,&a[i].z);
		}
		sort(a+1,a+m+1,cmp);
//		for(int i = 1; i <= m; i ++)
//		cout << a[i].x << " " << a[i].y << " " << a[i].z << endl;
		int ans = 10e8;
		for(int i = 1; i <= m - n + 2; i ++)
		{
			int t = kruskal(i);
			if(t < ans)
			ans = t;
		}
		if(ans == 10e8)
		cout << -1 << endl;
		else cout << ans << endl;
	}
	return 0;
}