Poj 1258 Agri-Net(最小生成树 kruskal)
来源:互联网 发布:htc u11 网络优化 编辑:程序博客网 时间:2024/05/21 06:11
题目:http://poj.org/problem?id=1258
Agri-Net
Time Limit: 1000MS Memory Limit: 10000KTotal Submissions: 45803 Accepted: 18857
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 <cstdio>#include <algorithm>using namespace std;const int maxn=1e4+10;struct node{ int from,to,w; bool operator<(const node b)const{ return w<b.w; }}edge[maxn/2];int father[110],edsum;int find(int x){ if(x==father[x]) return x; return find(father[x]);}int kruskal(int n){ int i,ans=0,top=0; for(i=0;i<=n;i++) father[i]=i; for(i=0;i<edsum;i++){ if(top==n-1) break; int q1=find(edge[i].from),q2=find(edge[i].to); if(q1!=q2){ ans+=edge[i].w; father[q1]=q2; top++; } } return ans;}int main(){ //freopen("cin.txt","r",stdin); int n; while(cin>>n){ int i,j,w; edsum=0; for(i=1;i<=n;i++){ for(j=1;j<=n;j++){ scanf("%d",&w); if(j>i){ edge[edsum].from=i; edge[edsum].to=j; edge[edsum++].w=w; } } } sort(edge,edge+edsum); printf("%d\n",kruskal(n)); } return 0;}
0 0
- Poj 1258 Agri-Net (最小生成树Prim & Kruskal)
- poj 1258 Agri-Net 最小生成树 kruskal
- POJ 1258 Agri-Net(最小生成树 Kruskal)
- POJ 1258 Agri-Net (kruskal求最小生成树)
- POJ 1258--Agri-Net【最小生成树 && Kruskal && 水题】
- POJ 1258 Agri-Net 最小生成树 prim && kruskal
- Poj 1258 Agri-Net(最小生成树 kruskal)
- POJ 1258 Agri-Net(最小生成树Kruskal算法)
- poj 1258 Agri-Net 【最小生成树-Kruskal】
- POJ 1258 Agri-Net 最小生成树(Kruskal算法入门)
- Agri-Net(POJ 1258)(裸最小生成树)(Prime算法+Kruskal算法)
- 文章标题 POJ 1258 : Agri-Net(最小生成树--kruskal)
- poj 1258 小白算法练习 Agri-Net 最小生成树 prim kruskal
- POJ 1258 Agri-Net(最小生成树)
- POJ 1258 Agri-Net 【最小生成树】
- Agri-Net - POJ 1258 最小生成树
- POJ 1258 Agri-Net 最小生成树
- POJ 1258 Agri-Net(最小生成树)
- 欢迎使用CSDN-markdown编辑器
- 使用dup2重定向了标准输出后,使用什么方法恢复对终端的输出?? http://bbs.chinaunix.net/forum.php?mod=viewthread&tid=359433&page=
- 模拟老师
- PAT 1098. Insertion or Heap Sort (25)
- 手势UIGestureRecognizer
- Poj 1258 Agri-Net(最小生成树 kruskal)
- 如何debug部署到客户环境里面的release版本的产品
- Things That Cannnot Change(Android里不能改变的东西)
- NSOperationQueue、NSOperation理解
- c文件操作函数
- iOS 计算文字的高度
- Java接口和抽象类的区别
- 编译hadoop的eclipse插件hadoop-eclipse-plugin-1.2.1.jar
- JDK配置环境变量方法