POJ 2393 最小瓶颈生成树裸体

来源：互联网发布：杨辉三角c语言程序7行编辑：程序博客网时间：2024/04/29 05:14

如题，是裸体

#include<cstdio>#include<cstring>#include<algorithm>using namespace std;const int maxn=2000+10;const int maxm=10000+10;struct Edge{    int u,v,dist;    Edge(){}    Edge(int u,int v,int d):u(u),v(v),dist(d){}    bool operator<(const Edge &rhs)const    {        return dist<rhs.dist;    }};struct Kruskal{    int n,m;    Edge edges[maxm];    int fa[maxn];    int findset(int x){return fa[x]==-1? x:fa[x]=findset(fa[x]);}    void init(int n)    {        this->n=n;        m=0;        memset(fa,-1,sizeof(fa));    }    void AddEdge(int u,int v,int dist)    {        edges[m++]=Edge(u,v,dist);    }    int kruskal()//返回瓶颈路长    {        int cnt=0;        sort(edges,edges+m);        for(int i=0;i<m;i++)        {            int u=edges[i].u, v=edges[i].v;            if(findset(u) != findset(v))            {                fa[findset(u)] =findset(v);                if(++cnt>=n-1) return edges[i].dist;            }        }        return -1;    }}KK;int main(){    int n,m;    scanf("%d%d",&n,&m);    KK.init(n);    for(int i=0;i<m;i++)    {        int u,v,d;        scanf("%d%d%d",&u,&v,&d);        KK.AddEdge(u,v,d);    }    printf("%d\n",KK.kruskal());    return 0;}

0 0