HDU 1102 最小生成树 prim
2011-11-20 01:08
399 查看
http://acm.hdu.edu.cn/showproblem.php?pid=1102
最小生成树 (prim)
代码:
最小生成树 (prim)
代码:
#include<cstdio> #include<iostream> const int inf=1002; using namespace std; int a[101][101],dis[101],visit[101]; int prim(int N)//1为原点 { int i,sum,min,mark,j,k; for(i=2;i<=N;i++) dis[i]=a[1][i]; dis[1]=0; visit[1]=1; sum=0; for(i=1;i<N;i++) { min=inf; for(k=1;k<=N;k++) { if(visit[k]==0&&min>dis[k]) { mark=k; min=dis[k]; } } sum+=min; visit[mark]=1; dis[mark]=0; for(j=1;j<=N;j++) { if(dis[j]>dis[mark]+a[mark][j]&&visit[j]==0) dis[j]=dis[mark]+a[mark][j]; } } return sum; } int main() { int N,i,j,Q; while(scanf("%d",&N)!=EOF) { for(i=1;i<=N;i++) { a[i][i]=0; visit[i]=0; for(j=1;j<=N;j++) { scanf("%d",&a[i][j]); } } scanf("%d",&Q); while(Q--) { scanf("%d%d",&i,&j); a[i][j]=0; a[j][i]=0; } int sum=prim(N); printf("%d\n", sum); } return 0; }
相关文章推荐
- hdu1102 Constructing Roads (最小生成树 prim 算法)
- HDU1102 Constructing Roads 最小生成树prim||kruskal
- HDU1102 - Constructing Roads 用优先队列优化Prim最小生成树
- HDU-1102(prim求最小生成树)
- 【最小生成树+Prim】杭电 hdu 1102 Constructing Roads
- hdu 1102 Constructing Roads(最小生成树 Prim)
- HDU1102 prim 最小生成树
- HDU - 1102-Constructing Roads——最小生成树prim
- hdu 1102 Constructing Roads(最小生成树 Prim)
- HDU 1102 Constructing Roads(最小生成树-Prim)
- HDU1102 prim 最小生成树
- hdu1102 - Constructing Roads (求最小生成树) (Prim & Kruskal)
- hdu1102 Constructing Roads--最小生成树prim
- HDU 1102 Constructing Roads(prim求最小生成树)
- hdu 1102 uva 10397(最小生成树prim)
- HDU 1102 Constructing Roads(Prim求最小生成树)
- hdu 1102 最小生成树prim模板题
- hdu 1102 Constructing Roads(最小生成树,prim)
- hdu 1102 Constructing Roads(最小生成树prim)
- hdu-1102 Constructing Roads(prim最小生成树)