hdu 1102 prime Constructing Roads
来源:互联网 发布:马航mh370调查 知乎 编辑:程序博客网 时间:2024/05/16 07:51
题目 http://acm.hdu.edu.cn/showproblem.php?pid=1102
刚开始做这个题目时,没看清题目意思 一直错误 纠结死了我 这个是一个简单的最小生成树问题哦
#include<iostream>#include<cstring>#include<cstdio>using namespace std;int map[101][101],dis[101];bool mark[101];int n,q,a,b;void prime(){ int min,sum,i,j,k; memset(dis,0,sizeof(dis)); memset(mark,false,sizeof(mark)); sum=0; for(i=1;i<=n;i++) dis[i]=map[1][i]; mark[1]=true; dis[1]=0; for(i=2;i<=n;i++) { min=999999; for(j=1;j<=n;j++) { if(!mark[j]&&dis[j]<min) ///找出最小距离哦 { min=dis[j]; k=j; } } sum+=min; mark[k]=true; for(j=1;j<=n;j++) ///更新距离 { if(!mark[j]&&dis[j]>map[k][j]) { dis[j]=map[k][j]; } } } cout<<sum<<endl;}int main(){ int i,j; while(scanf("%d",&n)!=EOF) { for(i=1;i<=n;i++) for(j=1;j<=n;j++) { scanf("%d",&map[i][j]); } scanf("%d",&q); while(q--) { scanf("%d %d",&a,&b); map[a][b]=map[b][a]=0; } prime(); } return 0;}
- hdu 1102 prime Constructing Roads
- HDU 1102 Constructing Roads -- prime
- hdu 1102 Constructing Roads<java><prime>
- hdu 1102 Constructing Roads(Prime算法)
- HDU 1102 Constructing Roads 最小生成树Prime算法
- HDU 1102 Constructing Roads
- HDU 1102 Constructing Roads
- Hdu-1102 Constructing Roads
- Hdu-1102 Constructing Roads
- hdu 1102 Constructing Roads
- HDU 1102 Constructing Roads
- hdu 1102 Constructing Roads
- hdu 1102 Constructing Roads
- HDU 1102 Constructing Roads
- HDU 1102 Constructing Roads
- HDU 1102 Constructing Roads
- hdu 1102 Constructing Roads
- Hdu 1102 - Constructing Roads
- 虚拟机安装系统时,提示system not found,解决方法
- 6.1 - 6.14 语句
- procrank查看物理内存
- 循环双链表之Java实现(模拟JDK中LinkedList)
- Blocks的详解与使用
- hdu 1102 prime Constructing Roads
- 基本字符——备份
- 解决列高度自适应的五种方法!
- Java DES加密解密详解
- UTF-8编码的特殊字符,在GBK下显示?的问题
- Qt学习 QVariant类(转)
- html 5 拖放
- word2007中怎么去掉小箭头【解决办法】
- C语言指针数组和数组指针