Argi-Net
来源:互联网 发布:泰安中商网络怎么样 编辑:程序博客网 时间:2024/04/29 21:47
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 <algorithm>#include <cstdio>#include <cstring>#include <cstdlib>#define N 1888#define INF 999999999using namespace std;int n,sum;bool vis[N];int map[N][N];//邻接矩阵存图int dis[N];//用来记录当前生成树到每个节点的距离void prim(){ int i,j,mm=INF; int bj; memset(vis,false,sizeof(vis)); sum=0; for(i=0; i<n; i++) dis[i]=map[0][i]; vis[0]=true;//0 对角线i=j for(i=0; i<n-1; i++) { mm=INF; for(j=0; j<n; j++) { if(vis[j]==false&&dis[j]<mm) { mm=dis[j]; bj=j; } } sum+=mm; vis[bj]=true; for(j=0; j<n; j++)//标记dis数组 { if(vis[j]==false&&dis[j]>map[j][bj]) dis[j]=map[j][bj];//如果该点还没别访问过 } //更新生成树到该点的距离 } printf("%d\n",sum);}int main(){ int i,j,k; while(~scanf("%d",&n)) { for(i=0; i<n; i++) for(j=0; j<n; j++) scanf("%d",&map[i][j]); prim(); } return 0;}
0 0
- Argi-Net
- .NET
- .net
- .net
- .NET
- .net
- .NET
- .net
- .net
- .net
- .NET
- .net
- .net
- .net
- .net
- .NET
- net
- .net
- bbs论坛搭建--Discuz的安装
- tomcat6.0发布应用
- 手机清理内存代码
- 看看,创专利、买专利、护专利可享哪些优惠
- 代码块
- Argi-Net
- 专利强制许可的双刃剑效应
- c# upd通讯超级简单版本
- 【Java】如何使用Eclipse中的调试器
- erlang四大behaviour之四-supervisor
- Groovy入门基础
- Julia:提高性能的N个点
- 安装xampp后apache不能启动解决方法
- [IOS 开发] iOS中的RunTime机制