POJ 1258 Agri-Net 【MST,Prime算法】
来源:互联网 发布:pe 知乎 怎么过 编辑:程序博客网 时间:2024/05/07 09:32
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 52097 Accepted: 21722
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
原题链接:http://poj.org/problem?id=1258
做这题的时候,傻X了。。。。悲剧。。。
AC代码:
#include <iostream>#include <cstdio>#include <cstring>using namespace std;const int INF=0x3f3f3f3f;int a[105][105];int dis[105];bool vis[105];int n;void Prime(){ for(int i=0; i<n; i++) { vis[i]=false; dis[i]=a[0][i]; } vis[0]=true; int ans=0; for(int i=1; i<n; i++) { int p=-1; int minn=INF; for(int j=0; j<n; j++) { if(!vis[j]&&dis[j]<minn) minn=dis[p=j]; } if(p==-1) { cout<<-1<<endl; return; } vis[p]=true; ans+=minn; for(int j=0; j<n; j++) { if(!vis[j]&&dis[j]>a[p][j])//SX了。。。 dis[j]=a[p][j]; } } cout<<ans<<endl;}int main(){ //freopen("data/1258.txt","r",stdin); while(cin>>n) { for(int i=0; i<n; i++) { for(int j=0; j<n; j++) scanf("%d",&a[i][j]); } Prime(); } return 0;}
0 0
- POJ 1258 Agri-Net 【MST,Prime算法】
- poj 1258 Agri-Net MST
- POJ 1258 Agri-Net(MST)
- [MST]POJ 1258Agri-Net
- POJ 1258 Agri-Net【MST】
- POJ 1258 Agri-Net MST .
- poj 1258 Agri-Net(最小生成树 prime算法)
- POJ 1258 Agri-Net (经典MST)
- POJ 1258 Agri-Net (MST)
- poj 1258Agri-Net(prime,Kruskal )
- POJ-1258-Agri-Net (prime + heap)
- POJ 1258 Agri-Net|| POJ 2485 Highways MST
- Poj 1258 Agri-Net[MST最小生成树]
- POJ 1258 Agri-Net (prim求MST)
- POJ-1258 Agri-Net 最小生成树(MST)
- poj 1258 Agri-Net 最经典的MST★
- Agri-Net(POJ 1258)(裸最小生成树)(Prime算法+Kruskal算法)
- POJ-1258--Agri-Net (最小生成树 Prime)
- iOS使用NSMutableAttributedString 实现富文本(不同颜色字体、下划线等)
- 求最长的升序子序列 并将最长的升序子序列输出
- LeetCode 383. Ransom Note
- Codeforces Round #367 (Div. 2) B Interesting drink(二分)
- 数据结构实验之二叉树六:哈夫曼编码
- POJ 1258 Agri-Net 【MST,Prime算法】
- java反射机制实例
- 02.变量和基本数据类型
- linux驱动入门之hello wrold
- string 转成OMElement和用string 生成soap MessageContext
- 游戏服务器体系结构
- 重写equals方法的注意事项
- 数据结构实验之二叉树一:树的同构
- 电信行业的容器化改造之道