zoukankan      html  css  js  c++  java
  • poj 1258 最小生成树

    链接: http://poj.org/problem?id=1258
     
    Agri-Net
    Time Limit: 1000MS   Memory Limit: 10000K
    Total Submissions: 38326   Accepted: 15424

    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


    代码:
    #include <stdio.h>
    #include <string.h>
    #include <stdlib.h>
    #include <algorithm>
    
    #define minn 0x3f3f3f3f
    #define maxx 105
    
    int map[maxx][maxx],low[maxx],visit[maxx];
    int n,m;
    
    int prim()
    {
        int i,j;
        int pos,result=0,min;
        memset(visit,0,sizeof(visit));
        visit[1]=1,pos=1;
        for(i=1;i<=n;i++)
        {
            if(i!=pos)
            {
                low[i]=map[pos][i];
            }
        }
        for(i=1;i<n;i++)
        {
            min=minn;
            for(j=1;j<=n;j++)
            {
                if(visit[j]==0 && min>low[j])
                {
                    min=low[j];
                    pos=j;
                }
            }
            result+=min;
            visit[pos]=1;
    
            for(j=1;j<=n;j++)
            {
                if(visit[j]==0 && low[j]>map[pos][j])
                {
                    low[j]=map[pos][j];
                }
            }
        }
        return result;
    }
    
    int main()
    {
        int i,j,k,t;
    
        while(scanf("%d",&n)!=EOF)
        {
            memset(map,minn,sizeof(map));
            for(i=1;i<=n;i++)
            {
                for(j=1;j<=n;j++)
                {
                    scanf("%d",&map[i][j]);
                }
            }
            int result=prim();
            printf("%d
    ",result);
        }
        return 0;
    }
    

      

    引自:http://www.cnblogs.com/Veegin/archive/2011/04/29/2032388.html

  • 相关阅读:
    从搭eclipse环境到导入maven工程
    基于jquery的多选下拉列框再次更改样式和交互
    BootStrap的typeahead使用过程中遇到的问题
    Vue webapp项目通过HBulider打包原生APP
    微信相机
    前端小新手,记录项目中不懂的问题
    判断pdf、word文档、图片等文件类型(格式)、大小的简便方法
    JavaScript学习笔记(一)——Map、Set与iterable
    oracle nvl函数
    mybaits中主键自动生成并返回主键
  • 原文地址:https://www.cnblogs.com/ccccnzb/p/3830267.html
Copyright © 2011-2022 走看看