poj3522 Slim Span 最长边与最短边差值最小的生成树，kruskal算法 + 暴力枚举

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

思路：题目要求最长边与最短边差值最小的生成树。直接暴力枚举每一个生成树。找生成树时使用kruskal算法的变形，即给定起始最短边的kruskal算法。

///2014.7.8
///poj3522

//Accepted  716K    125MS   G++ 1936B   2014-07-08 15:25:20

/*
 *最长边与最短边差值最小的生成树，kruskal算法 + 暴力枚举
 */

#include <iostream>
#include <algorithm>
#include <cstring>
#include <cstdio>
using namespace std;

struct Road
{
    int x,y,l;
};
bool cmp(Road a,Road b){
    return a.l < b.l;
}

int n,m;
int minSub,sub;
Road road[5500];

int dSet[110];
int find(int x){
    while( dSet[x] != x )
        x = dSet[x];
    return x;
}
bool judge(int x,int y){
    int fx = find(x);
    int fy = find(y);
    if( fx==fy )
        return false;
    else{
        dSet[fy] = fx;
        return true;
    }
}

void init(){
    for(int i=0 ; i<n ; i++)
        dSet[i] = i;
    minSub = sub = 0;
    int a,b,c;
    int k = 0;
    for(int i=0 ; i<m ; i++){
        scanf("%d %d %d",&a,&b,&c);
        road[k].x = a-1;
        road[k].y = b-1;
        road[k].l = c;
        k++;
    }
    sort(road,road+m,cmp);
}
int kruskal(int start){
    for(int i=0 ; i<n ; i++)
        dSet[i] = i;
    if( m-start < n-1 ) return -1;

    int k = 0,j = start;
    int minl = road[j].l;
    int maxl = 0;
    while( k<n-1 && j<m ){
        if( judge( road[j].x , road[j].y) ){
            maxl = road[j].l;
            k++;
        }
        j++;
    }
    if( k==n-1 )
        return maxl-minl;
    else
        return -1;
}

int main(){
    // freopen("in","r",stdin);
    // freopen("out","w",stdout);

    while( ~scanf("%d %d",&n,&m) && n ){
        init();
        if( m < n-1 )
            printf("-1\n");
        else{
            minSub = kruskal(0);
            if( minSub == -1 )
                printf("-1\n");
            else{
                int i = 1;
                while( (sub = kruskal(i) ) != -1 ){
                    if( minSub > sub ) minSub = sub;
                    i++;
                }
                printf("%d\n",minSub );
            }
        }
    }
    return 0;
}