POJ 3522 Slim Span

Description
Given an undirected weighted graph G, you should find one of spanning trees specified as follows.
The graph G is an ordered pair (V, E), where V is a set of vertices {v1, v2, …, vn} and E is a set of undirected edges {e1, e2, …, em}. Each edge e ∈ E has its weight w(e).
A spanning tree T is a tree (a connected subgraph without cycles) which connects all the n vertices with n − 1 edges. The slimness of a spanning tree T is defined as the difference between the largest weight and the smallest weight among the n − 1 edges of T.
Figure 5: A graph G and the weights of the edges
For example, a graph G in Figure 5(a) has four vertices {v1, v2, v3, v4} and five undirected edges {e1, e2, e3, e4, e5}. The weights of the edges are w(e1) = 3, w(e2) = 5, w(e3) = 6, w(e4) = 6, w(e5) = 7 as shown in Figure 5(b).
Figure 6: Examples of the spanning trees of G
There are several spanning trees for G. Four of them are depicted in Figure 6(a)~(d). The spanning tree Ta in Figure 6(a) has three edges whose weights are 3, 6 and 7. The largest weight is 7 and the smallest weight is 3 so that the slimness of the tree Ta is 4. The slimnesses of spanning trees Tb, Tc and Td shown in Figure 6(b), (c) and (d) are 3, 2 and 1, respectively. You can easily see the slimness of any other spanning tree is greater than or equal to 1, thus the spanning tree Td in Figure 6(d) is one of the slimmest spanning trees whose slimness is 1.
Your job is to write a program that computes the smallest slimness.

---

【题目分析】
喜闻乐见的1A题目。可以证明，kruskal算法选择的最大值一定是最小的。我们可以从最小的边开始选择，然后再删去最小的边，用次小边作为最小值再用一遍kruskal，然后不断的更新答案。
这道题要注意边界的处理，比如说无解的情况等等。详细的内容还是看代码吧。

---

【代码】

#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
struct edge{
    int a,b,w;
    bool operator <(const edge &x) const{
        return w<x.w;
    }
}c[10001];
int n,m,ans=-1,f[101];
inline int gf(int k)
{
    if (f[k]==k) return k;
    else return f[k]=gf(f[k]);
}
inline int kru(int st)
{
    int ans=-1,num=n-1;
    for (int i=1;i<=n;++i) f[i]=i;
    for (int i=st;i<=m;++i)
    {
        int f1=gf(c[i].a),f2=gf(c[i].b);
        if (f1==f2) continue;
        f[f1]=f2;
        num--;
        if (num==0) {ans=c[i].w; break;}
    }
    return ans-c[st].w;
}
int main()
{

    while (~scanf("%d%d",&n,&m)&&(n||m))
    {
        for (int i=1;i<=m;++i) scanf("%d%d%d",&c[i].a,&c[i].b,&c[i].w);
        sort(c+1,c+m+1);
        ans=kru(1);
        if (ans<0) {printf("-1\n");continue;}
        for (int i=2;i<=m;++i)
        {
            int now=kru(i);
            if (now<0) break;
            else ans=min(ans,now);
        }
        printf("%d\n",ans);
    }
}