poj1258——Agri-Net(最小生成树)
2016-04-01 11:09
411 查看
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
两万多人交。。。看来只有我刚刚会
#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#define INf 0xfffffff
using 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;
}
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<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#define INf 0xfffffff
using 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;
}
相关文章推荐
- 系统的备份恢复
- Selenium+Python windows下环境搭建
- java5 Condition用法--实现线程间的通信
- 同步、异步、阻塞和非阻塞区别
- ReSharper 配置及用法
- oninput,onpropertychange,onchange的用法和区别
- javascript继承
- iOS开发系列之Xcode插件--Alcatraz的安装和使用
- 字符串作业5
- mysql 中对记录随机排序
- userdel删除用户时候提示:userdel: user xx is currently logged in
- php编译参数详解
- js 取值
- LeetCode *** 258. Add Digits
- 如何读取sd下的json文件,并解析展示,添加到数据库中
- sqlserver、Mysql、Oracle三种数据库的优缺点总结
- 分析可变形字符串序列StringBuilder 以及 StringBuffer之默认大小与扩容
- Android Volley完全解析(一),初识Volley的基本用法
- eclipse启动时报错,显示查看log日志,解决最佳方案
- 浏览器内核判断