Bad Cowtractors (最小生成树)

Bessie has been hired to build a cheap internet network among Farmer John's N (2 <= N <= 1,000) barns that are conveniently numbered 1..N. FJ has already done some surveying, and found M (1 <= M <= 20,000) possible connection routes between pairs of barns. Each possible connection route has an associated cost C (1 <= C <= 100,000). Farmer John wants to spend the least amount on connecting the network; he doesn't even want to pay Bessie. 

Realizing Farmer John will not pay her, Bessie decides to do the worst job possible. She must decide on a set of connections to install so that (i) the total cost of these connections is as large as possible, (ii) all the barns are connected together (so that it is possible to reach any barn from any other barn via a path of installed connections), and (iii) so that there are no cycles among the connections (which Farmer John would easily be able to detect). Conditions (ii) and (iii) ensure that the final set of connections will look like a "tree".

Input

* Line 1: Two space-separated integers: N and M 

* Lines 2..M+1: Each line contains three space-separated integers A, B, and C that describe a connection route between barns A and B of cost C.

Output

* Line 1: A single integer, containing the price of the most expensive tree connecting all the barns. If it is not possible to connect all the barns, output -1.

Sample Input

5 8
1 2 3
1 3 7
2 3 10
2 4 4
2 5 8
3 4 6
3 5 2
4 5 17

Sample Output

42

Hint

OUTPUT DETAILS: 

The most expensive tree has cost 17 + 8 + 10 + 7 = 42. It uses the following connections: 4 to 5, 2 to 5, 2 to 3, and 1 to 3.

思路

这道题用了最小生成数的思路。虽然这道题要求的是最大的费用，但所用到的方法也是和最小生成树的差不多

#include <iostream>
#include <stdio.h>
#include <algorithm>

using namespace std;
int m,n,l=0;
long long k;
int f[1005];
struct point
{
    int x,y;
    int w;
}points[20005];

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

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

void mer(int a,int b)
{
    int a1=Find(a);
    int b1=Find(b);
    if(a1!=b1)
    {
        f[b1]=a1;
    }
    return ;
}

int krusal(int m)
{
    sort(points,points+m,cmp);
    long long ans=0;
    for(int i=0;i<m;i++)
    {
        int x=Find(points[i].x);
        int y=Find(points[i].y);
        if(x!=y)
        {
            mer(x,y);
            ans+=points[i].w;
            l++;
        }
        else
            continue;
    }
    return ans;
}
int main()
{
    scanf("%d %d",&n,&m);
    int a,b,c;
    for(int i=0;i<=n;i++)
        f[i]=i;
    for(int i=0;i<m;i++)
    {
        scanf("%d %d %d",&a,&b,&c);
        points[i].x=a;
        points[i].y=b;
        points[i].w=c;
    }
    k=krusal(m);
    if(l==n-1)
    {
        printf("%lld\n",k);
    }
    else
        printf("-1\n");
    return 0;
}