zoj 1406 Jungle Roads

从A到F找到最短路即可，由于我不会用prim算法

只能用ku...算法，幸好这道题没有让输出路路径，

所以用ku...算法也行

我通常都是这样写的1.把边存起来2.快排3.并查集

呵呵，过了，还行吧，对了输入注意用scanf

中的%d前加一个空格

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include<math.h>typedef struct Tedge
{int from,to;int dist;
}edge;edge dis[100];
int N;
int fa[30];int find(int x)
{if(x == fa[x])return x;fa[x] = find(fa[x]);return(fa[x]);
}int cmp(const void *a,const void *b)
{return (*(edge *)a).dist - (*(edge *)b).dist;
}int main()
{int n,sub,m,d,i,count,sum;char ch;while(scanf("%d",&n)==1,n){N = 0;sub = n;sub -= 1; while(sub--){scanf(" %c",&ch);dis[N].from = ch - 'A' + 1;scanf("%d",&m);for(i=1;i<m;i++)dis[N+i].from = dis[N].from;while(m--){scanf(" %c",&ch);scanf("%d",&d);dis[N].to = ch - 'A' + 1;dis[N].dist = d;N++;}}                                  //输入完成qsort(dis,N,sizeof(edge),cmp);   for(i=1;i<=n;i++)fa[i] = i;count =0;sum = 0;for(i=0;i<N;i++){if(find(dis[i].from) != find(dis[i].to)){fa[find(dis[i].from)] = find(dis[i].to);sum += dis[i].dist;count++;if(count == (n-1))break;}}       printf("%d\n",sum);}return 0;
}

转载于:https://www.cnblogs.com/java0721/archive/2011/08/17/2602957.html

zoj 1406 Jungle Roads相关推荐

HDU 1301 Jungle Roads(裸最小生成树）
题目链接今天做了好几个模版最小生成树...贴一个kurskral. 1 /* 2 HDU 1301 Jungle Roads 3 最小生成树Kurskal模版 4 */ 5 #include < ...
【HDU - 1301】Jungle Roads（并查集+最小生成树）（内附最小生成树两种算法克鲁斯特尔算法amp;amp;普里姆算法）
题干: Jungle Roads Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others) ...
Jungle Roads//最小生成树kruskal
题目: Jungle Roads Time Limit: 2 Seconds Memory Limit: 65536 KB The Head Elder of the tropical is ...
Jungle Roads丛林道路（最小生成树PrimKruskal算法)
Jungle Roads丛林道路 POJ - 1251 目录 Jungle Roads丛林道路题意描述 Kruskal算法解题思路 Kruskal AC代码 Prim 解题思路 AC代码 The H ...
题目1154：Jungle Roads
题目描述: The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money ...
hdu 1301 Jungle Roads 最小生成树
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1301 The Head Elder of the tropical island of Lagrish ...
（kruskal）Jungle Roads
题目 The Head Elder of the tropical island of Lagrishan has a problem. A burst of foreign aid money wa ...
[HDOJ1301]Jungle Roads
题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=1301 最小生成树 (Kruskal) 1 #pragma warning(disable:4996) ...
POJ 1251 Jungle Roads
题意:给你n个点 n-1行每行代表的是这个点到给定点的距离求最短路解题思路:开始是用getchar 发现runtime error 后来用了字符串才改进了裸Kruskal ...

zoj 1406 Jungle Roads

zoj 1406 Jungle Roads相关推荐

最新文章

热门文章