Agri-Net POJ 1258 【Prim】
来源:互联网 发布:淘宝 无人机 编辑:程序博客网 时间:2024/04/27 06:55
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<stdio.h>#include<string.h>#define INF 0x3f3f3f3f#define N 110int n;int i,j;int map[N][N];int a,b;int low[N];bool vis[N];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;}
0 0
- Agri-Net POJ 1258 【Prim】
- poj 1258 Agri-Net(prim)
- POJ 1258----Agri-Net(prim)
- POJ 1258 Agri-Net (prim + kruskal)
- poj 1258 Agri-Net(Kruskal || Prim )
- POJ 1258 Agri-Net Prim/Kruskal
- POJ 1258Agri-Net (Prim)
- poj 1258 Agri-Net(prim)
- POJ 1258 Agri-Net(裸prim)
- poj 1258 Agri-Net (prim算法)
- POJ 1258 Agri-Net prim算法
- POJ 1258 Agri-Net (prim算法)
- POJ 1258 Agri-Net(Prim算法)
- Agri-Net (poj 1258 最短路+prim)
- poj 1258 Agri-Net Prim + kruskal
- POJ 1258Agri-Net Prim算法模型
- POJ 1258 Agri-Net //Prim算法
- poj 1258 Agri-Net(Prim)(基础)
- 提交表单时的中文乱码问题
- php-app接口实现(json和xml)
- vmware虚拟机NAT通信方式配置
- kvm(1)之快速使用
- MySQL索引类型
- Agri-Net POJ 1258 【Prim】
- CSUOJ:集训队组队计划
- Elastos测试框架搭建--测试用例运行流程
- Shell脚本学习(一) - 创建脚本
- 点击tableview的头视图按钮来达到收放tableview的列表
- 关于BaseAdapter的getView方法的理解
- HDU 5378 Leader in Tree Land 树形背包
- 知乎向左,果壳向右
- roll pitch yaw