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

    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
     1 #include<cstdio>
     2 #include<cstring>
     3 #include<iostream>
     4 #include<algorithm>
     5 using namespace std;
     6 
     7 const int maxn=10005;
     8 
     9 struct edge{
    10     int u,v,cost;
    11     bool operator<(const edge& i)const{
    12         return cost<i.cost;
    13     }
    14 }es[maxn];
    15 
    16 int n,cnt;
    17 int F[maxn],map[101][101];
    18 
    19 int Find(int a){
    20     if(a!=F[a]) F[a]=Find(F[a]);
    21     return F[a];
    22 }
    23 
    24 bool unite(int a,int b){
    25     int x=Find(a),y=Find(b);
    26     if(x!=y) { F[x]=y; return true; }
    27     else return false;
    28 } 
    29 
    30 int Kruskal(){
    31     sort(es,es+cnt);
    32     int ans=0;
    33     for(int i=0;i<cnt;i++){
    34         edge e=es[i];
    35         if(unite(e.u,e.v)) ans=ans+e.cost;
    36     }
    37     return ans;
    38 }
    39 
    40 int main()
    41 {    while(cin>>n){
    42         cnt=0;
    43         for(int i=0;i<n;i++){ 
    44             for(int j=0;j<n;j++){
    45                 scanf("%d",&map[i][j]);
    46                 es[cnt].u=i;
    47                 es[cnt].v=j;
    48                 es[cnt].cost=map[i][j];
    49                 cnt++;
    50             }
    51         }
    52         for(int i=0;i<n;i++) F[i]=i;
    53         cout<<Kruskal()<<endl;
    54     }
    55     return 0;
    56 }
  • 相关阅读:
    JS数组存储(两个数组相等,一个改变,另一个跟着改变)
    图片404加载失败后如何处理
    为什么重写equals方法,还必须要重写hashcode方法
    Java中HashMap和TreeMap的区别深入理解
    java中String数组和List的互相转化
    log4j重复打印的解决方法
    mysql 允许在唯一索引的字段中出现多个null值
    elasticsearch 常见查询及聚合的JAVA API
    A记录(主机名解析)、CNAME(别名解析)和URL转发(域名转发)
    域名解析中的cname解析和显性URL跳转和隐性URL跳转三者有什么区别
  • 原文地址:https://www.cnblogs.com/zgglj-com/p/7348295.html
Copyright © 2011-2022 走看看