zoukankan      html  css  js  c++  java
  • POJ

    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.
     
     
    题意:求最大生成树。
    思路:只需在生成树基础上用sort降序排序。
     
    #include<stdio.h>
    #include<algorithm>
    using namespace std;
    
    int f[1005];
    
    struct Node{
        int u,v,w;
    }edge[20005];
    
    bool cmp(Node a,Node b)
    {
        return a.w>b.w;
    }
    
    int find(int x)
    {
        return f[x]==x?x:f[x]=find(f[x]);
    }
    
    int kru(int n,int m)
    {
        int i;
        for(i=1;i<=n;i++){
            f[i]=i;
        }
        sort(edge+1,edge+m+1,cmp);
        int cnt=0,ans=0;
        for(i=1;i<=m;i++){
            int u=edge[i].u;
            int v=edge[i].v;
            int w=edge[i].w;
            int fu=find(u),fv=find(v);
            if(fu!=fv){
                ans+=w;
                f[fv]=fu;
                cnt++;
            }
            if(cnt==n-1) break;
        }
        if(cnt<n-1) return -1;
        else return ans;
    }
    
    int main()
    {
        int n,m,u,v,w,i;
        scanf("%d%d",&n,&m);
        for(i=1;i<=m;i++){
            scanf("%d%d%d",&u,&v,&w);
            edge[i].u=u;
            edge[i].v=v;
            edge[i].w=w;
        }
        printf("%d
    ",kru(n,m));
        return 0;
    }
  • 相关阅读:
    WampServer软件
    ASP.NET Core中返回 json 数据首字母大小写问题
    区块链的入门与应用(1)
    阿里云oss 的坑==》 路径有区分大小写
    uni-app 学习笔记 小于号问题
    uni-app 学习笔记-引用外部js并调用
    net core 简单读取json配置文件
    net core 3 使用 autofac
    js 获取对应的url参数
    postman 跟restsharp 模拟请求http
  • 原文地址:https://www.cnblogs.com/yzm10/p/7277231.html
Copyright © 2011-2022 走看看