zoukankan      html  css  js  c++  java
  • POJ 1258 Agri-Net

    http://poj.org/problem?id=1258

    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 <iostream>
    #include <stdio.h>
    #include <string.h>
    using namespace std;
    
    #define inf 0x3f3f3f3f
    int cost[110][110];
    int mincost[110];
    bool used[110];
    int N;
    
    int prim() {
        memset(mincost, inf, sizeof(mincost));
        memset(used, false, sizeof(used));
    
        mincost[0] = 0;
        int res = 0;
    
        while(true) {
            int v = -1;
            for(int u = 0; u < N; u ++) {
                if(!used[u] && (v == -1 || mincost[u] < mincost[v]))
                    v = u;
            }
            if(v == -1) break;
            used[v] = true;
            res += mincost[v];
    
            for(int u = 0; u < N; u ++)
                mincost[u] = min(mincost[u], cost[v][u]);
        }
        return res;
    }
    
    int main() {
        while(~scanf("%d", &N)) {
            for(int i = 0; i < N; i ++) {
                for(int j = 0; j < N; j ++)
                    scanf("%d", &cost[i][j]);
            }
    
            int ans = prim();
            printf("%d
    ", ans);
        }
        return 0;
    }
    

      

  • 相关阅读:
    Word中如何让两个图片垂直居中对齐
    Visio对象插入Word后周围空白过大
    Matlab绘图时横坐标重叠怎么办
    Word中设置所有西文字体为新罗马
    最小二乘法为什么使用误差平方和
    python 网络编程——客户端
    padding
    Ubuntu apache
    网上流行的各开源框架与技术
    Ubuntu下使用SVN
  • 原文地址:https://www.cnblogs.com/zlrrrr/p/9756970.html
Copyright © 2011-2022 走看看