zoukankan      html  css  js  c++  java
  • 3.1.1 Agri-Net

    Agri-Net
    Russ Cox

    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.

    PROGRAM NAME: agrinet

    INPUT FORMAT

    Line 1: The number of farms, N (3 <= N <= 100).
    Line 2..end: The subsequent lines contain the N x N connectivity 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.

    SAMPLE INPUT (file agrinet.in)

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

    OUTPUT FORMAT

    The single output contains the integer length that is the sum of the minimum length of fiber required to connect the entire set of farms.

    SAMPLE OUTPUT (file agrinet.out)

    28

    /*
      ID: makeeca1
      PROG: agrinet
      LANG: C++
     */
    #include <cstdio>
    using namespace std;
    #define MAX 110
    int ans,flag[MAX],dist[MAX][MAX],n,mindist,minflag;
    int main(){
        freopen("agrinet.in","r",stdin);
        freopen("agrinet.out","w",stdout);
        scanf("%d",&n);
        for (int i=0;i<n;i++)
            for (int j=0;j<n;j++)
                scanf("%d",&dist[i][j]);
        ans=0;flag[0]=1;
        for (int i=1;i<n;i++){
            mindist=0;minflag=-1;
            for (int i=0;i<n;i++)
                for (int j=0;j<n;j++)
                    if (dist[i][j] && flag[i] && !flag[j])
                        if (mindist==0 || mindist>dist[i][j]){
                            mindist=dist[i][j];
                            minflag=j;
                        }
            flag[minflag]=1;
            ans+=mindist;
        }
        printf("%d
    ",ans);
        return 0;
    }
  • 相关阅读:
    缓冲式I/O
    事件轮询接口
    博弈游戏
    多任务I/O之poll函数
    好的link
    做纹理处理的。。。
    快毕业了!
    语音处理的资料
    google图像搜索原理
    install opencv in centos
  • 原文地址:https://www.cnblogs.com/makeecat/p/3288959.html
Copyright © 2011-2022 走看看