# POJ 1258 Agri-Net (最小生成树)

Agri-Net
Time Limit: 1000MS Memory Limit: 10000K
Total Submissions: 49879 Accepted: 20738
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

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

4
0 4 9 21
4 0 8 17
9 8 0 16
21 17 16 0
Sample Output

28

#include <iostream>
#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;
const int maxx=10005;
struct node
{
int x;
int y;
int w;
}s[maxx];
int par[maxx];
int n;
int cmp(node a,node b)
{
return a.w<b.w;
}
void init()
{
for(int i=0;i<=n;i++)
par[i]=i;
}
int find(int x)
{
if(par[x]==x)
return x;
return par[x]=find(par[x]);
}
void unite(int x,int y)
{
x=find(x);
y=find(y);
if(x!=y)
par[y]=x;
else
return ;
}

int main()
{
while(~scanf("%d",&n))
{
init();
int a[105][105];
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
scanf("%d",&a[i][j]);
}
}
int k=0;
for(int i=1;i<=n;i++)
{
for(int j=1;j<=n;j++)
{
s[k].x=i; //找各点之间的关系
s[k].y=j;
s[k++].w=a[i][j];
}
}
sort(s,s+k,cmp);
int coun=0;
int sum=0;
for(int i=0;i<k;i++)
{
node e=s[i];
if(find(e.x)!=find(e.y))
{
coun++;
unite(e.x,e.y);
sum+=e.w;
}
if(coun>=n-1)
break;
}
printf("%d\n",sum);
}

return 0;
}


• 本文已收录于以下专栏：

## poj1258Agri-Net（最小生成树）

• zcmartin2014214283
• 2016年06月16日 14:33
• 204

## poj1258 - Agri-Net

• wangjian8006
• 2012年08月17日 09:45
• 4070

## poj-1258-Agri-Net

Description Farmer John has been elected mayor of his town! One of his campaign promises was to bri...
• Ypopstar
• 2016年09月22日 23:58
• 283

## POJ1258最小生成树简单题

• u013761036
• 2015年02月06日 16:39
• 1083

## POJ 1258 Agri-Net（最小生成树 Kruskal）

• acvay
• 2014年10月22日 10:37
• 799

## Agri-Net - POJ 1258 最小生成树

Agri-Net Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 36534   Acce...
• u014733623
• 2014年04月16日 18:53
• 569

## Poj 1258 Agri-Net【最小生成树】

Agri-Net Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 45255   Accepted: 18591 ...
• liuke19950717
• 2015年08月12日 20:51
• 344

## POJ 1258 Agri-Net 最小生成树

• Virus_1996
• 2016年04月02日 17:34
• 127

## Agri-Net poj 1258 最小生成树

Agri-Net Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 54239   Acce...
• hang__xiu2016acm
• 2016年11月21日 13:05
• 106

## POJ 1258 Agri-Net（最小生成树）

Agri-Net Time Limit: 1000MS Memory Limit: 10000K Total Submissions: 49376 Accepted: 20...
• qq_32866009
• 2016年05月05日 14:30
• 172

举报原因： 您举报文章：POJ 1258 Agri-Net (最小生成树) 色情 政治 抄袭 广告 招聘 骂人 其他 (最多只允许输入30个字)