zoukankan      html  css  js  c++  java
  • Poj2377--Bad Cowtractors(最大生成树)

    Bad Cowtractors
    Time Limit: 1000MS   Memory Limit: 65536K
    Total Submissions: 12058   Accepted: 5008

    Description

    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.

    Source

    最小生成树变形, 求最大生成树。 知识掌握不扎实, Wnm, 晕到权值都初始化为负值了,还处理成INF, 智商捉急啊。 Kl 比较好想。
    Prim ac:
    #include <cstdio>
    #include <cstring>
    #include <iostream>
    using namespace std;
    const int INF = 0x3f3f3f3f; 
    int map[1010][1010], dis[1010], vis[1010];
    int n, m;
    void Prim()
    {
        int TotalMon = 0;
        memset(vis, 0, sizeof(vis));
        for(int i = 1; i <= n; i++)
            dis[i] = map[1][i];
        vis[1] = 1; 
        for(int i = 1; i < n; i++){
            int temp = 1, max = 0;
            for(int j = 1; j <= n; j++)
            {
                if(!vis[j] && dis[j] > max)
                {
                    temp = j;
                    max = dis[j];    
                }    
            }
            if(max == 0){
                printf("-1
    ");
                return;
            }
            TotalMon += max;
            vis[temp] = 1;
            for(int j = 1; j <= n; j++)
                if(!vis[j] && dis[j] < map[temp][j] && map[temp][j] != INF)
                    dis[j] = map[temp][j];
                
        }    
        printf("%d
    ", TotalMon);
    } 
    int main()
    {
        while(~scanf("%d %d", &n, &m))
        {
            int u, v, w;
            memset(map, -1, sizeof(map));       //权值初始化为负;
            for(int i = 0; i < m; i++){
                scanf("%d %d %d", &u, &v, &w); 
                if(map[u][v] < w)
                    map[u][v] = map[v][u] = w;
            }
            Prim();
        }
        return 0;
    }
  • 相关阅读:
    [Swift通天遁地]七、数据与安全-(10)文件的加密压缩和解压加密压缩
    [Swift通天遁地]七、数据与安全-(9)文件的压缩和解压
    [Swift]LeetCode406. 根据身高重建队列 | Queue Reconstruction by Height
    [Swift]LeetCode403. 青蛙过河 | Frog Jump
    [Swift]LeetCode402. 移掉K位数字 | Remove K Digits
    [Swift]LeetCode399. 除法求值 | Evaluate Division
    [Swift通天遁地]七、数据与安全-(8)创建普通PDF文档和加密PDF文档
    Singleton单例模式
    Could not read from remote repository.
    Hadoop Web项目--Friend Find系统
  • 原文地址:https://www.cnblogs.com/soTired/p/4764731.html
Copyright © 2011-2022 走看看