poj1258——Agri-Net(最小生成树)
来源:互联网 发布:战无不胜神兵进阶数据 编辑:程序博客网 时间:2024/05/16 17:54
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.
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
40 4 9 214 0 8 179 8 0 1621 17 16 0
Sample Output
28
两万多人交。。。看来只有我刚刚会
#include<iostream>#include<cstdio>#include<cstring>#include<cstdlib>#define INf 0xfffffffusing namespace std;int n,map[105][105],sum,vis[105];void prim(){ int w[105],dis,v,minn,i,j; for(i=0; i<n; ++i) w[i]=map[0][i]; for(i=1; i<n; ++i) { minn=INf; for(j=1;j<n; ++j) { if(!vis[j]&&w[j]<minn) { minn=w[j]; v=j; } } sum+=w[v]; vis[v]=true; for(j=1;j<n;++j) if(!vis[j]) w[j]=min(w[j],map[v][j]); }}int main(){ int i,j; while(~scanf("%d",&n)) { memset(map,0,sizeof(map)); memset(vis,0,sizeof(vis)); for(i=0; i<n; ++i) for(j=0; j<n; ++j) { scanf("%d",&map[i][j]); } sum=0; prim(); printf("%d\n",sum); } return 0;}
0 0
- POJ1258——Agri-Net(最小生成树)
- poj1258——Agri-Net(最小生成树)
- POJ1258 Agri-Net(最小生成树)
- POJ1258 Agri-Net(最小生成树)
- POJ1258 Agri-Net(最小生成树)
- poj1258 Agri-Net最小生成树问题
- POJ1258 - Agri-Net - 最小生成树
- POJ1258 Agri-Net 【最小生成树Prim】
- poj1258--Agri-Net(最小生成树)
- [poj1258 Agri-Net]最小生成树
- POJ1258 Agri-Net 最小生成树
- poj1258 Agri-Net(最小生成树)
- poj1258 Agri-Net 最小生成树
- poj1258 Agri-Net 最小生成树
- poj1258 Agri-Net (最小生成树prime)
- POJ1258 Agri-Net(最小生成树,prim算法)
- ACM-MST(最小生成树)之Agri-Net——poj1258
- POJ1258,Agri-Net,明显的最小生成树
- js 取值
- php编译参数详解
- Android Volley完全解析(一),初识Volley的基本用法
- mysql 中对记录随机排序
- eclipse启动时报错,显示查看log日志,解决最佳方案
- poj1258——Agri-Net(最小生成树)
- 如何读取sd下的json文件,并解析展示,添加到数据库中
- ReSharper 配置及用法
- 愚人节开启自己学习安卓的博客生涯,记录自己学习过程中遇到的问题
- 同步、异步、阻塞和非阻塞区别
- 对最强大的android下拉刷新空间ultra-pull-to-refresh的理解
- Oracle Study之-AIX6.1构建Oracle 10gR2 RAC(5)
- 欢迎使用CSDN-markdown编辑器
- oninput,onpropertychange,onchange的用法和区别