【Codevs1078】最小生成树 Prim算法(5/1000)
来源:互联网 发布:webuploader php demo 编辑:程序博客网 时间:2024/05/29 17:51
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
Line 1: The number of farms, N (3 <= N <= 100).
Line 2: The subsequent lines contain the N x N connectivity 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.
Sample Input
4
0 4 9 21
4 0 8 17
9 8 0 16
21 17 16 0
Sample Ouput
28
纯模板题,最小生成树prim之邻接矩阵实现,而这个模板我觉得特别漂亮,很简洁,也很清晰。
借鉴了下面这个博客,感谢一下。
TRTTG
#include<cstdio>#include<cstring>#include<iostream>#include<algorithm>using namespace std;const int N=1000+10;const int INF=0x3f3f3f3f;int n,ans=0,tmp,k;int dist[N],vis[N],a[N][N];int main(){ //freopen("in.txt","r",stdin); //freopen("out.txt","w",stdout); cin>>n; for(int i=1;i<=n;i++){ for(int j=1;j<=n;j++){ cin>>a[i][j]; } } memset(dist,0x3f,sizeof(dist)); dist[1]=0; for(int i=1;i<=n;i++){ tmp=INF; for(int j=1;j<=n;j++){ if (!vis[j]&&dist[j]<tmp){ tmp=dist[j]; k=j; } } ans+=dist[k]; vis[k]=1; for(int j=1;j<=n;j++){ if (!vis[j]&&a[k][j]<dist[j]) dist[j]=a[k][j]; } } cout<<ans<<endl; return 0;}
- 【Codevs1078】最小生成树 Prim算法(5/1000)
- 【codevs1078】最小生成树,prim算法
- codevs1078 最小生成树
- Codevs1078 最小生成树( kruskal )
- 数据结构5-最小生成树Prim算法
- 最小生成树(prim算法)
- 最小生成树算法(prim&kruskal)
- 最小生成树(prim算法)--poj1258
- 最小生成树(Prim算法)
- HDU1863---最小生成树(prim算法)
- 最小生成树(Prim算法)
- 最小生成树(prim算法)
- 最小生成树(prim算法模板)
- 最小生成树prim算法(贪心)
- 数据结构--最小生成树(Prim算法)
- Prim算法(最小生成树)
- 数据结构:最小生成树(Prim算法)
- 最小生成树(hdu1233)Prim算法
- 一个简单的DGA(Domain Generate Algorithm)
- STL(二)vector 动态数组
- shell脚本批量操作用户
- fastjson中JSON语句与map转换(结合List与JSONObject)
- FZU 2028
- 【Codevs1078】最小生成树 Prim算法(5/1000)
- Druid集成Kerberos
- 如何在Android系统锁屏后使程序继续运行
- JAVA通过URL下载文件(POST,参数)
- 【Python】判断一个字符串是否是合法IP地址
- 随机删除重复数据
- PHP二维数组根据某一个字段进行排序
- Pytorch-学习记录 卷积操作——Tensor.size()
- Java 深入学习(2) —— ArrayList、LinkedList、Vector 应用场景与性能分析