POJ 3522 Slim Span (最小生成树)

题目链接：http://poj.org/problem?id=3522

 

题意：简单的来说就是求一棵生成树使最大的边和最小的边差值最小

 

思路：用kruskal算法，按照边权从小到大进行枚举，注意判断这些边能否生成MST

 

 

#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
#include <vector>

using namespace std;

int fa[200], n, m;
const int inf = 1e9;

struct edge
{
    int a, b, w, fl;
    edge() {}
    edge(int a, int b, int w, int fl) : a(a), b(b), w(w), fl(fl) {}
    bool operator < (const edge &rhs) const
    {
        return w < rhs.w;
    }
} e[10010];

int Find(int x)
{
    if(x == fa[x])
        return x;
    return fa[x] = Find(fa[x]);
}

int kruskal(int num)
{
    int cnt = 1, ans = 0;
    int Max = 0, Min = inf;
    for(int i = num; i < m; i++)
    {
        int fx = Find(e[i].a);
        int fy = Find(e[i].b);
        if(fx != fy)
        {
            ans += e[i].w;
            cnt++;
            fa[fy] = fx;
            Max = max(Max, e[i].w);
            Min = min(Min, e[i].w);
        }
    }
    if(cnt != n)
        return inf;
    return Max - Min;
}

void init()
{
    for(int i = 0; i <= n; i++)
        fa[i] = i;
}

int main()
{
    while(~scanf("%d%d", &n, &m) && (n + m))
    {
        init();
        for(int i = 0; i < m; i++)
            scanf("%d%d%d", &e[i].a, &e[i].b, &e[i].w);
        sort(e, e + m);
        int ans = inf;
        for(int i = 0; i < m; i++)
        {
            init();
            int sum = kruskal(i);
            ans = min(ans, sum);
        }
        if(ans == inf)
            cout << "-1" << endl;
        else
            cout << ans << endl;
    }
    return 0;
}