POJ1258_Agri-Net(最小生成树)
来源:互联网 发布:win10更新软件 编辑:程序博客网 时间:2024/06/05 01:34
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 37921 Accepted: 15241
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
Source
USACO 102
解题报告
都是1A的模板。
#include <iostream>#include <stdio.h>#include <string.h>#define inf 99999999using namespace std;int mmap[110][110];int n;void prim(){ int i,j,u,minn,ans=0; int dis[110]; int vis[110]; for(i=0;i<n;i++) { dis[i]=mmap[0][i]; vis[i]=0; } dis[0]=0; vis[0]=1; for(i=0;i<n-1;i++) { u=0;minn=inf; for(j=0;j<n;j++) { if(!vis[j]&&dis[j]<minn) { u=j; minn=dis[j]; } } ans+=minn; vis[u]=1; for(j=0;j<n;j++) { if(!vis[j]&&dis[j]>mmap[u][j]) { dis[j]=mmap[u][j]; } } } printf("%d\n",ans);}int main(){ int i,j; while(~scanf("%d",&n)&&n) { memset(mmap,0,sizeof(mmap)); for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&mmap[i][j]); prim(); } return 0;}
0 0
- Poj1258_Agri-Net(最小生成树)
- POJ1258_Agri-Net(最小生成树)
- 【最小生成树】局域网(net)
- POJ 1258 Agri-Net(最小生成树)
- USACO Agri-Net,最小生成树
- POJ 1258 Agri-Net 【最小生成树】
- POJ1258Agri-Net (最小生成树之prim)
- Agri-Net - POJ 1258 最小生成树
- POJ 1258 Agri-Net 最小生成树
- POJ 1258 Agri-Net(最小生成树)
- POJ 1258 Agri-Net 最小生成树
- poj1258 Agri-Net最小生成树问题
- [入门]最小生成树--poj1258 Agi-Net
- POJ1258 - Agri-Net - 最小生成树
- POJ 1258 Agri-Net 最小生成树
- Agri-Net(最小生成树)
- POJ1258 Agri-Net 【最小生成树Prim】
- poj1258--Agri-Net(最小生成树)
- 设置ctrl+shift+f 不换行与自动换行
- Stockbroker Grapevine POJ【简单dijkstra】
- HTML5主要特性
- 在Winform中发HTTP请求(调用WebService服务)
- CentOS 编译安装 MongoDB
- POJ1258_Agri-Net(最小生成树)
- 教你8招打造夏季阳台 纳凉乐活两不误
- ActiveX 部件不能创建对象解决思路
- http://blog.csdn.net/zouxy09/article/details/7949126
- easyui中的datagrid被隐藏后,再显示不了
- 指尖上的艺术——如何运用代码发挥无限创意
- DTrace tricks and tips (3) - 访问程序全局变量
- oracle 11g 下载地址
- 【设计模式】Singleton Pattern——单例模式