Bad Cowtractors POJ - 2377 (最大生成树)

传送门

题解：求一个最大生成树，只需要把排序顺序颠倒即可

附上代码：

#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>

using namespace std;

const int MAXN=1100;
const int MAXM=40040;

struct edge{
    int u,v,w;
};
edge edges[MAXM];

bool cmp(edge a,edge b)
{
    return a.w>b.w;
}

int f[MAXN];

int find(int x)
{
    if(x==f[x]){
        return x;
    }else{
        f[x]=find(f[x]);
        return f[x];
    }
}

void merge(int a,int b)
{
    int t1=find(a);
    int t2=find(b);
    if(t1!=t2){
        f[t2]=t1;
    }
    return ;
}

void krusal(int n,int m)
{
    sort(edges,edges+m,cmp);
    int ans=0,count=0;
    for(int i=0;i<m;i++){
        int u=find(edges[i].u);
        int v=find(edges[i].v);
        if(u!=v){
            ans+=edges[i].w;
            merge(u,v);
            count++;
        }else{
            continue;
        }
    }
    if(count==n-1){
        cout<<ans<<endl;
    }else{
        cout<<"-1"<<endl;
    }
}

int main()
{
    int N,M;
    while(scanf("%d%d",&N,&M)!=EOF){
        for(int i=1;i<=N;i++){
            f[i]=i;
        }
        for(int i=0;i<M;i++){
            scanf("%d%d%d",&edges[i].u,&edges[i].v,&edges[i].w);
        }
        krusal(N,M);
    }
    return 0;
}