http://acm.nyist.net/JudgeOnline/problem.php?pid=434
来源:互联网 发布:金三税个人所得税软件 编辑:程序博客网 时间:2024/04/29 13:46
一道最小生成树的题,属于模板题,,,,月赛竟然弄了这么长时间,才AC,这道替我用的是prim算法,用krusal也可以,,,
#include<iostream>#include<string.h>#include<algorithm>#define N 28#define M 99999999using namespace std;int map[N][N];int dist[N];bool visit[N];int n,m;void prim(){ int i,j;for( i=1;i<=m;++i){ dist[i]=M; visit[i]=true;}int now=1; dist[now]=0; visit[now]=false; int ans=0; for( i=1;i<=m;i++) { ans+=dist[now]; for( j=1;j<=m;++j) if(visit[j]&&dist[j]>map[now][j]) dist[j]=map[now][j]; int minx=M; for(j=1;j<=m;j++) if(dist[j]<minx&&visit[j]) minx=dist[now=j]; visit[now]=false; } cout<<ans<<endl;}int main(){ while(cin>>n&&n){ int nn,i,j,s,aa,bb; char ch,mm; m=0;for( i=1;i<=28;++i)for( j=1;j<=28;j++) map[i][j]=M; for( i=1;i<=n-1;++i){ cin>>ch; bb=(int)(ch-64);cin>>nn;for( j=1;j<=nn;++j){ cin>>mm;cin>>s; aa=(int)(mm-64);if(aa>m) m=aa; if(map[bb][aa]>s) { map[bb][aa]=s; map[aa][bb]=s; }}}prim();}return 0;}
- http://acm.nyist.net/JudgeOnline/problem.php?pid=434
- http://acm.nyist.net/JudgeOnline/problem.php?pid=290
- http://acm.nyist.net/JudgeOnline/problem.php?pid=13
- http://acm.nyist.net/JudgeOnline/problem.php?pid=239
- http://acm.nyist.net/JudgeOnline/problem.php?pid=129
- http://acm.nyist.net/JudgeOnline/problem.php?pid=431
- http://acm.nyist.net/JudgeOnline/problem.php?pid=301
- http://acm.nyist.net/JudgeOnline/problem.php?pid=451
- http://acm.nyist.net/JudgeOnline/problem.php?pid=459
- http://acm.nyist.net/JudgeOnline/problem.php?pid=20
- http://acm.nyist.net/JudgeOnline/problem.php?pid=267
- http://acm.nyist.net/JudgeOnline/problem.php?pid=305
- http://acm.nyist.net/JudgeOnline/problem.php?pid=309
- http://acm.nyist.net/JudgeOnline/problem.php?pid=325
- http://acm.nyist.net/JudgeOnline/problem.php?pid=420
- http://acm.nyist.net/JudgeOnline/problem.php?pid=488
- http://acm.nyist.net/JudgeOnline/problem.php?pid=150
- http://acm.nyist.net/JudgeOnline/problem.php?pid=119
- 禁用javascript
- 你不必非要给自己找个老板
- VC2005从开发MFC ActiveX ocx控件到发布到.net网站的全部过程
- js时按钮不能使用详解
- 我思故我在系列—数据结构面试NO.20题将一串字符串转为整数(题目搜集整理者JVLY,非常感谢!!)
- http://acm.nyist.net/JudgeOnline/problem.php?pid=434
- Eclipse基本使用1
- 用socket实现代理的样子的各种方式:socket实现方式,telnet 实现方式 ,http proxy 实现方式
- Socket编程(一)
- Android 的用户层 uevent处理机制
- JavaScript学习笔记(一)——基本语法
- 《Oracle编程艺术》学习笔记(22)-表类型
- OK6410裸机调试(使用串口,不需要使用JLINK)
- 编程匠艺(一)善于防守——健壮代码的防御性编程技巧