hdu 1301 Jungle Roads - c++编程基础

GhlIG9uZSBtaW51dGUKIHRpbWUgbGltaXQuIDxicj4KCgogCjxicj4KClNhbXBsZSBJbnB1dAoKPHByZSBjbGFzcz0="brush:java;">9 A 2 B 12 I 25 B 3 C 10 H 40 I 8 C 2 D 18 G 55 D 1 E 44 E 2 F 60 G 38 F 0 G 1 H 35 H 1 I 35 3 A 2 B 10 C 40 B 1 C 20 0
Sample Output

216
30

把字母表对应为数字，建立二维数组存储点与点之间距离；

prim算法

#include"stdio.h"
#include"string.h"
#include"math.h"
#define N 30
const int Inf=10000;
int map[N][N];
int dis[N],mark[N];
int prim(int n)
{
	int i,min,index,ans;
	memset(mark,0,sizeof(mark));
	mark[0]=1;
	index=0;
	for(i=0;i
  
   map[index][i])
				dis[i]=map[index][i];
	}
}
int main()
{
	int n,m,i,j,a,b,c;
	char ch;
	while(scanf("%d",&n),n)
	{
		for(i=0;i

hdu 1301 Jungle Roads(二)