HDU - 1301 - Jungle Roads （最小生成树！！prim算法！！） - 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

Source Mid-Central USA 2002

AC代码：

#include 
  
   
#include 
   
     #include 
    
      #define INF 0x7fffffff using namespace std; int map[30][30], vis[30], dis[30]; int n; void prim() { for(int i=1; i<=n; i++) { dis[i] = map[1][i]; } dis[1] = 0; vis[1] = 1; int sum = 0, pos; for(int i=1; i

HDU - 1301 - Jungle Roads （最小生成树！！prim算法！！）(二)