Agti—Net
来源:互联网 发布:mac上好用的office软件 编辑:程序博客网 时间:2024/06/14 19:25
Agri-Net
Problem 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<stdio.h>#include<cstring>using namespace std;const int MAX=1e9;int main(){ int t,n; int p[510][510],dis[510],vis[510]; while(cin>>n && n) { memset(p,0,sizeof(p)); memset(vis,0,sizeof(vis)); for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) { scanf("%d",&p[i][j]); } } memset(dis,0x7f,sizeof(dis)); dis[1]=0; int maxn=0,k; int sum=0; for(int i=1;i<=n;i++) { k=0; for(int j=1;j<=n;j++) { if(vis[j]==0 && dis[k]>dis[j]) { k=j; } } vis[k]=1;//标记成白点 sum+=dis[k]; for(int j=1;j<=n;j++) { if(vis[j]==0 && p[k][j]<dis[j]) { dis[j]=p[k][j]; } } } cout<<sum<<endl; } return 0;}
阅读全文
0 0
- Agti—Net
- .NET代码——.NET 连接oracle
- 【ASP.NET】——ADO.NET
- 【ASP.NET】——asp.net入门
- VB.Net—配置文件
- .NET—数据库设计
- vb.net—配置文件
- ASP.net—总结
- 购物车—NET
- .NET
- .net
- .net
- .NET
- .net
- .NET
- .net
- .net
- .net
- 排序1——冒泡,选择排序
- 【C语言】指针
- JZOJ5233 【GDOI模拟8.5】概率博弈 树形dp
- VMware虚拟机搭MAC系统
- Beanutils基本用法
- Agti—Net
- 读书笔记(一)——《Java核心技术卷一》第三章Java的基本程序设计结构
- java 类初始化顺序
- tensorflow模型量化
- 文章标题
- 小写数字金额转大写
- leetcode 545. Boundary of Binary Tree
- sleep() 和 wait() 有什么区别?
- 安卓动画学习笔记