HDU 1598 find the most comfortable road 并查集+贪心

对边做一个排序，然后对于每一个询问，每次都去枚举权值最小的边，再做最小生成树，一旦询问中的点联通了，我们就可以认为在当前最小边权值的情况下，舒适度最大的情况已经达到了。

#include<iostream>
#include<cstdio>
#include<string.h>
#include<algorithm>
#include<cmath>
using namespace std;

int fa[210],n,m,q;

struct node{
    int x,y,w;
    bool operator < (const node &n) const {return w<n.w;}
}edge[1010];

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

int join(int a,int b)
{
    int ret=0;
    int fx=find(a); int fy=find(b);
    if (fx!=fy)
    {
        fa[fx]=fy;
        ret=1;
    }
    return ret;
}

int main()
{
    while (~scanf("%d%d",&n,&m))
    {
        for (int i=1; i<=m; i++)
        {
            scanf("%d%d%d",&edge[i].x,&edge[i].y,&edge[i].w);
        }
        sort(edge+1,edge+1+m);
        scanf("%d",&q);
        for (int i=1; i<=q; i++)
        {
            int a,b; scanf("%d%d",&a,&b);
            int ans=1000000;
            for (int j=1; j<=m; j++)
            {
                //cout<<"j="<<edge[j].w<<endl;
                int tmp=-1;
                for (int k=1; k<=n; k++)
                {
                    fa[k]=k;
                }
                for (int k=j; k<=m; k++)
                {
                    //cout<<"k="<<edge[k].w<<endl;
                    join(edge[k].x,edge[k].y);
                    //cout<<"1="<<edge[k].x<<" 2="<<edge[k].y<<endl;
                    if (find(a)==find(b))
                    {
                        tmp=edge[k].w-edge[j].w;
                        //cout<<"tmp="<<tmp<<endl;
                        break;
                    }
                }
                if (tmp!=-1) ans=min(ans,tmp);
            }
            if (ans==1000000) printf("-1\n");
            else printf("%d\n",ans);
        }
    }
    return 0;
}