zoukankan      html  css  js  c++  java
  • POJ 1258 Agri-Net (最小生成树)

    Agri-Net

    题目链接:

    http://acm.hust.edu.cn/vjudge/contest/124434#problem/H

    Description

    Farmer John has been elected mayor of his town! One of his campaign promises was to bring internet connectivity to all farms in the area. He needs your help, of course.
    Farmer John ordered a high speed connection for his farm and is going to share his connectivity with the other farmers. To minimize cost, he wants to lay the minimum amount of optical fiber to connect his farm to all the other farms.
    Given a list of how much fiber it takes to connect each pair of farms, you must find the minimum amount of fiber needed to connect them all together. Each farm must connect to some other farm such that a packet can flow from any one farm to any other farm.
    The distance between any two farms will not exceed 100,000.

    Input

    The input includes several cases. For each case, the first line contains the number of farms, N (3 <= N <= 100). The following lines contain the N x N conectivity matrix, where each element shows the distance from on farm to another. Logically, they are N lines of N space-separated integers. Physically, they are limited in length to 80 characters, so some lines continue onto others. Of course, the diagonal will be 0, since the distance from farm i to itself is not interesting for this problem.

    Output

    For each case, output a single integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.

    Sample Input

    4
    0 4 9 21
    4 0 8 17
    9 8 0 16
    21 17 16 0

    Sample Output

    28


    ##题意: 求最小的花费使得各点联通.
    ##题解: 裸的最小生成树.
    ##代码: ``` cpp #include #include #include #include #include #include #include #include #include #define LL long long #define eps 1e-8 #define maxn 110 #define mod 100000007 #define inf 0x3f3f3f3f #define IN freopen("in.txt","r",stdin); using namespace std;

    struct node{
    int left,right,cost;
    }road[maxn*maxn];

    int cmp(node x,node y) {return x.cost<y.cost;}
    int p[maxn],m,n;
    int find(int x) {return p[x]=(p[x]==x? x:find(p[x]));}
    int kruskal()
    {
    int ans=0;
    for(int i=1;i<=n;i++) p[i]=i;
    sort(road+1,road+m+1,cmp);
    for(int i=1;i<=m;i++)
    {
    int x=find(road[i].left);
    int y=find(road[i].right);
    if(x!=y)
    {
    ans+=road[i].cost;
    p[x]=y;
    }
    }
    return ans;
    }

    int dis[maxn][maxn];

    int main(int argc, char const *argv[])
    {
    //IN;

    while(scanf("%d", &n) != EOF)
    {
        m = 0;
        memset(road,0,sizeof(road));
    
        for(int i=1; i<=n; i++) {
            for(int j=1; j<=n; j++) {
                scanf("%d", &dis[i][j]);
            }
        }
    
        for(int i=1; i<=n; i++) {
            for(int j=i+1; j<=n; j++) {
                road[++m].left = i;
                road[m].right = j;
                road[m].cost = dis[i][j];
            }
        }
    
        int ans=kruskal();
    
        printf("%d
    ", ans);
    }
    
    return 0;
    

    }

  • 相关阅读:
    递归获取指定盘符下的所有文件及文件夹
    单例模式和多线程有没有关系?
    eclipse启动tomcat时设置端口
    dozer转化对象
    枚举
    dubbo
    json
    配网失败问题
    esp_err_t esp_event_loop_init(system_event_cb_t cb, void *ctx);
    base64编码
  • 原文地址:https://www.cnblogs.com/Sunshine-tcf/p/5719876.html
Copyright © 2011-2022 走看看