Agri_Net

题目: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.
思路:最小生成树的prim算法

import java.io.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;

public class Agri_Net1 {

    public static void main(String[] args) throws IOException { 
        BufferedReader read = new BufferedReader(new InputStreamReader( System.in)); 
        String s = null; 
        int n; 
        int[][] a; 
        int t; 
        String[] str; 
        int index; 
        while ((s = read.readLine()) != null) { 
            if (s.equals("")) { break; } 
            n = Integer.parseInt(s); 
            a = new int[n][n]; 
            t = n; 
            while (t--> 0) {
                 index=0; 
                 while (index!=n) { 
                 str = read.readLine().split(" "); 
                 for (int i=0; i<str.length;i++, index++) { 
                    a[n-t-1][index] = Integer.parseInt(str[i]); 
                 }
             } 
        } 
        System.out.println(prim(n, a)); 
        } 
    } 
    public static int prim(int count,int [][]arr){
        int sum = 0; 
        int i, j, k; 
        int[] lower = new int[count]; 
        int[] edge = new int[count]; 
        boolean[] checked = new boolean[count]; 
        for (i = 0; i < count; i++) { 
            lower[i] = arr[0][i]; 
            edge[i] = 0; 
            checked[i] = false; 
        } 
        checked[0] = true; 
        for (i = 1; i < count; i++) { 
            j = 0;
            while (checked[j]) { j++; } 
            for (k = 0; k < count; k++) { 
                if ((!checked[k]) && (lower[k] < lower[j])) { j = k; } 
            } 
            sum += lower[j]; 
            checked[j] = true; 
            for (k = 0; k < count; k++) { 
                if (!checked[k] && (arr[j][k] < lower[k])) { 
                { 
                lower[k] = arr[j][k]; 
                edge[k] = j;
                } 
                } 
            }
        } 
        return sum;     
    }
}
  • 0
    点赞
  • 0
    收藏
    觉得还不错? 一键收藏
  • 0
    评论

“相关推荐”对你有帮助么?

  • 非常没帮助
  • 没帮助
  • 一般
  • 有帮助
  • 非常有帮助
提交
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值