2017 UESTC Training for Graph Theory

枚举+MST中的排序（自然就有了最大边（-最小边））的差值最小，（类似最小瓶颈路）
在枚举L的时候，R保持原位

#include<bits/stdc++.h>

using namespace std;
#define sf scanf
#define pf printf
#define mem(a,b) memset(a,b,sizeof(b));
#define rep(i,a,b) for(int i=(a);i<=(b);++i)
#define bug1 puts("bug1");
#define bug2 puts("bug2");
#define bug3 puts("bug3");
#define N 205
#define M 1010
const int INF=1e9;
const int inf=0x3f3f3f3f;
int n,m;
int fa[N];
struct Edge{
    int u,v,w;
    bool friend operator <(Edge a,Edge b){
        return a.w<b.w;
    }
}edge[M*2];
int find(int x){
    return fa[x]==x?x:fa[x]=find(fa[x]);
}
bool solve(int l,int r){
    bool flag1=false,flagn=false;
    rep(i,1,n)fa[i]=i;
    int minn=INF,maxx=-INF;
    rep(i,l,r){
        int fx=find(edge[i].u),fy=find(edge[i].v);
        if(fx!=fy){
            fa[fx]=fy;
            if(find(1)==find(n))return true;
        }
    }
    return false;
}
int main(){
    while(~sf("%d%d",&n,&m)){
        int tol=0;
        rep(i,1,m){
            int u,v,w;
            sf("%d%d%d",&edge[i].u,&edge[i].v,&edge[i].w);
        }
        sort(edge+1,edge+1+m);
        int ans=INF;
        int l=1,r=1;
        while(r<=m){
            r=max(r,l);
            if(solve(l,r)){ans=min(ans,edge[r].w-edge[l].w);l++;}
            else r++;
        }
        pf("%d\n",ans);
    }
}