zoukankan      html  css  js  c++  java
  • ZOJ 1542 POJ 1861 Network 网络 最小生成树,求最长边,Kruskal算法

    题目连接:ZOJ 1542 POJ 1861 Network 网络

    Network

    Time Limit: 2 Seconds      Memory Limit: 65536 KB      Special Judge

    Andrew is working as system administrator and is planning to establish a new network in his company. There will be N hubs in the company, they can be connected to each other using cables. Since each worker of the company must have access to the whole network, each hub must be accessible by cables from any other hub (with possibly some intermediate hubs).

    Since cables of different types are available and shorter ones are cheaper, it is necessary to make such a plan of hub connection, that the maximum length of a single cable is minimal. There is another problem - not each hub can be connected to any other one because of compatibility problems and building geometry limitations. Of course, Andrew will provide you all necessary information about possible hub connections.

    You are to help Andrew to find the way to connect hubs so that all above conditions are satisfied.


    Input

    The first line of the input file contains two integer numbers: N - the number of hubs in the network (2 <= N <= 1000) and M - the number of possible hub connections (1 <= M <= 15000). All hubs are numbered from 1 to N. The following M lines contain information about possible connections - the numbers of two hubs, which can be connected and the cable length required to connect them. Length is a positive integer number that does not exceed 10^6. There will be no more than one way to connect two hubs. A hub cannot be connected to itself. There will always be at least one way to connect all hubs.

    Process to the end of file.


    Output

    Output first the maximum length of a single cable in your hub connection plan (the value you should minimize). Then output your plan: first output P - the number of cables used, then output P pairs of integer numbers - numbers of hubs connected by the corresponding cable. Separate numbers by spaces and/or line breaks.


    Sample Input

    4 6
    1 2 1
    1 3 1
    1 4 2
    2 3 1
    3 4 1
    2 4 1


    Sample Output

    1
    4
    1 2
    1 3
    2 3
    3 4


    分析:求最小生成树中的最长边的值。然后输出所选择的边。Kruskal算法。


    代码:

    #include <iostream>
    #include <cstdio>
    #include <cstring>
    #include <algorithm>
    #include <cmath>
    #include <cstdlib>
    using namespace std;
    
    #define maxn 1010
    #define maxm 15002
    int n, m, maxlen, cnt;
    int parent[maxn], ans[maxn];
    struct edge
    {
        int u, v, w;
    }EG[maxm];
    
    bool cmp(edge a, edge b)
    {
        return a.w < b.w;
    }
    int Find(int x)
    {
        if(parent[x] == -1) return x;
        return Find(parent[x]);
    }
    void Kruskal()
    {
        memset(parent, -1, sizeof(parent));
        sort(EG, EG+m, cmp);
        for(int i = 0; i < m; i++)
        {
            int t1 = Find(EG[i].u), t2 = Find(EG[i].v);
            if(t1 != t2)
            {
                if(maxlen < EG[i].w)
                    maxlen = EG[i].w;
                ans[cnt++] = i;
                parent[t1] = t2;
            }
        }
    }
    int main()
    {
        while(~scanf("%d%d", &n, &m))
        {
            for(int i = 0; i < m; i++)
                scanf("%d%d%d", &EG[i].u, &EG[i].v, &EG[i].w);
            maxlen = cnt = 0;
            Kruskal();
            printf("%d
    ", maxlen);
            printf("%d
    ", cnt);
            for(int i = 0; i < cnt; i++)
                printf("%d %d
    ", EG[ans[i]].u, EG[ans[i]].v);
        }
        return 0;
    }
    





  • 相关阅读:
    基于连通性状态压缩的动态规划问题
    2005年IT行业趋势Top10
    企业应用之性能实时度量系统演变
    云计算参考架构几例
    在CentOS上构建.net自动化编译环境
    Asp.net SignalR 实现服务端消息推送到Web端
    餐饮行业解决方案之客户分析流程
    餐饮行业解决方案之采购战略制定与实施流程
    餐饮行业解决方案之业务设计流程
    零售连锁专卖信息化解决方案简介之三
  • 原文地址:https://www.cnblogs.com/bhlsheji/p/5194681.html
Copyright © 2011-2022 走看看