zoukankan      html  css  js  c++  java
  • POJ1258——Prim——Agri-Net

    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

    Source

    大意:铺电缆,不就是铺路嘛(⊙_⊙),直接写一个A了
    #include<cstdio>
    #include<cstring>
    #include<algorithm>
    using namespace std;
    const int inf = 0x3f3f3f3f,MAX = 3000;
    int map[MAX][MAX], k[MAX];
    void prim (int map[MAX][MAX],int n){
        int min1,m,ans = 0;
        for(int i = 1; i <= n ;i++)
            k[i] = map[1][i];
        for(int i = 1; i < n ;i++){
             int min1 = inf;
             m = 0;
             for(int j = 1; j <= n ;j++){
                if(k[j] < min1 && k[j]!=0){
                 min1 = k[j];
                 m = j;
                }
             }
             k[m] = 0;
             ans +=min1;
             for(int j = 1; j <= n ; j++){
                if(k[j] > map[m][j] && k[j]!=0)
                    k[j] = map[m][j];
             }
        }
        printf("%d
    ",ans);
    }
    int main()
    {
        int n,a;
        while(~scanf("%d",&n)&&n){
                for(int i = 1; i <= n ;i++)
                  for(int j = 1; j <= n ;j++)
                    scanf("%d",&map[i][j]);
                prim(map,n);
        }
        return 0;
    }
    View Code
  • 相关阅读:
    Java ClassLoader
    Java Hashcode
    Java 装箱 拆箱
    Java 深拷贝,浅拷贝
    Java IO流
    JVM内存模型
    C语言中的__FILE__、__LINE__和#line
    OpenMP和MPI的区别
    visual studio代码备份精减
    MVVM设计模式在WPF中的应用
  • 原文地址:https://www.cnblogs.com/zero-begin/p/4321770.html
Copyright © 2011-2022 走看看