Agri-Net POJ 1258 【Prim】
2015-08-12 15:39
381 查看
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
Sample Output
28
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<stdio.h> #include<string.h> #define INF 0x3f3f3f3f #define N 110 int n; int i,j; int map ; int a,b; int low ; bool vis ; void input() { for(i=1;i<=n;++i) { for(j=1;j<=n;++j) { scanf("%d",map[i]+j); } } } void prim() { int pos=1; int sum=0; for(i=1;i<=n;++i)//第一次给low赋值 { low[i]=map[pos][i]; } vis[pos]=1; //加入最小生成树集合 for(i=1;i<n;++i)//再找n-1个点 { int min=INF; for(j=1;j<=n;++j) { if(!vis[j]&&min>low[j]) { min=low[j]; pos=j;//把找到的点记录下 } } sum+=min; vis[pos]=1; for(j=1;j<=n;++j) { if(!vis[j]&&low[j]>map[pos][j]) { low[j]=map[pos][j]; } } } printf("%d\n",sum); } int main() { while(~scanf("%d",&n)) { memset(vis,0,sizeof(vis)); input(); prim(); } return 0; }
相关文章推荐
- sybase 优化总结
- AngularJs 初级入门 学习笔记
- javafx tabPane
- Activex、OLE、COM、OCX、DLL之间的区别(转)
- HTML5在input背景提示文本(placeholder)的CSS美化
- 关于在阿里云ESC服务器解析域名并绑定服务器IP后上传文件通过域名访问步骤教程
- 批处理的基础知识
- Maximum Depth of Binary Tree
- UITableView
- 【leetcode】Valid Anagram 【java】
- 【干货】产品经理每日必看的数据统计表
- C/C++中如何获取数组的长度?
- Android View事件分发和处理
- 消除空格的正则表达式
- 学习python自动化运维笔记文件比较
- Database Initialization Strategies in Code-First & Seed Data(sample role)
- 在.gitignore中过滤不必要的文件
- 如何查看mysql运行、访问记录等日志
- IOS 的material design汇总
- IOS远程推送通知