HDU 1301 Jungle Roads
2012-05-07 22:43
351 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1301
最简单的最小生成树
View Code
最简单的最小生成树
View Code
#include <stdio.h> #include <stdlib.h> int p[30]; int cnt,n; typedef struct L { int a,b,d; }L; L r[1000]; int cmp(const void*a,const void*b){return (*(struct L*)a).d-(*(struct L*)b).d;} int find(int x){return p[x]==x?x:p[x]=find(p[x]);} int Kruskal() { int i,ans=0; int x,y; for(i=0;i<n;i++)p[i]=i; qsort(r,cnt,sizeof(L),cmp); for(i=0;i<cnt;i++) { x=find(r[i].a); y=find(r[i].b); if(x!=y){ans+=r[i].d;p[x]=y;} } return ans; } int main() { int m,i,j; int dis; char rt,lf; while(scanf("%d%*c",&n),n) { cnt=0; for(i=0;i<n-1;i++) { scanf("%c%d%*c",&rt,&m); for(j=0;j<m;j++) { scanf("%c%d%*c",&lf,&dis); r[cnt].a=rt-'A'; r[cnt].b=lf-'A'; r[cnt++].d=dis; } } printf("%d\n",Kruskal()); } return 0; }
相关文章推荐
- hdu 1301 Jungle Roads<java><prime>
- hdu 1301 Jungle Roads poj
- (step6.1.6)hdu 1301(Jungle Roads——最小生成树)
- hdu 1301 Jungle Roads &&poj 1251 (prim 或者kruskal)
- HDU 1301:Jungle Roads【Prim】
- HDU 1301 Jungle Roads
- hdu 1301 prime Jungle Roads
- HDU Jungle Roads 1301 最小生成树、
- Jungle Roads HDU - 1301 (最小生成树 prim)
- hdu_1301 Jungle Roads
- hdu1301——Jungle Roads——最小生成树
- HDU 1301 Jungle Roads Kruskal求解
- hdu Jungle Roads
- HDOJ&nbsp;&nbsp;1301&nbsp;&nbsp;Jungle&nbsp;Roads
- 杭电1301--Jungle Roads(最小生成…
- hdu Jungle Roads(水题,prim)
- hdu 1025 Constructing Roads In JGShining's Kingdom(最长上升子序列nlogn算法)
- hdu 1301&& ny 434 &&poj 1251 Jungle Roads【最小生成树】
- hdu1301——Jungle Roads
- HDU1301:Jungle Roads(prime)