http://bailian.openjudge.cn/practice/1258/
1258:Agri-Net
描述
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.
输入
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.
输出
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.
样例输入
4
0 4 9 21
4 0 8 17
9 8 0 16
21 17 16 0
样例输出
28
来源
USACO 102
思路
裸的最小生成树,模板题,求最小路径和。
注意:读入数组是个二维矩阵。
1、scanf(......&w)
2、edge边数组 ,一定要开成nmax*nmax ,不然会Runtime Error.
AC Code
#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int nmax=105;
int n,m;//点数、边数
struct Edge{
int u,v,val;//起点、终点、边权
}edge[nmax*nmax];//edge边数组 ,一定要开成nmax*nmax
bool cmp(Edge a,Edge b){
return a.val<b.val; //按照边权从小到大排序,求最小生成树
}
int father[nmax];
int findFather(int u){
if(u==father[u]) return u;
else{
int f=findFather(father[u]);
father[u]=f;
return f;
}
}
void init(int n){
for(int i=0;i<n;i++){
father[i]=i;
}
}
void Kruskal(){//返回最小生成树的边权和
init(n);
//sort(edge,edge+m,cmp);
int cnt=0;//有效合并次数
int ans=0;//最小边权和
for(int i=0;i<m;i++){//遍历m条边
int fu=findFather(edge[i].u);
int fv=findFather(edge[i].v);
if(fu!=fv){
father[fu]=fv;
ans+=edge[i].val;
//printf("%d\n",ans);
cnt++;
}
if(cnt==n-1)//合并了N-1条边,已经找到了最小生成树
break;
}
if(cnt==n-1)//找到最小生成树
printf("%d\n",ans);
else //图不连通
return;
}
int main(int argc, char** argv) {
while(scanf("%d",&n)!=EOF){
memset(father,0,sizeof(father));
//memset(edge,0,sizeof(edge));
init(n);
int w;
int id=0;
for(int i=0;i<n;i++){
for(int j=0;j<n;j++){
scanf("%d",&w);//&w
edge[id].u=i;
edge[id].v=j;
edge[id].val=w;
id++;
}
}
m=id;
//printf("m:%d\n",m);
sort(edge,edge+m,cmp);
Kruskal();
}
return 0;
}