POJ 2485，1258

POJ 2485，1258

题目大意：水水的最小生成树模型= =；

解：prim，堆都不用了，1a有木有，纯当英语阅读了。

const
        maxn=111;
var
        g: array[1..maxn, 1..maxn]of longint;
        dist: array[1..maxn]of longint;
        n, ans: longint;
procedure init;
var
        i, j: longint;
begin
  ans := 0;
  filldword(dist, sizeof(dist)>>2, maxlongint);
  n := 0;
  readln(n);
  if n=0 then
    begin
      close(input);
      close(output);
      halt;
    end;
  for i := 1 to n do
    begin
      for j := 1 to n do
        read(g[i, j]);
      readln;
    end;
end;

procedure prim;
var
        i, u, j, tot, min: longint;
begin
  u := 1;
  dist[u] := -1;
  for i := 1 to n-1 do
    begin
      for j := 1 to n do
        if (dist[j]<>-1)and(g[u, j]<dist[j]) then
          dist[j] := g[u, j];
      min := maxlongint;
      for j := 1 to n do
        if (dist[j]<>-1)and(min>dist[j]) then
          begin
            tot := j;
            min := dist[j];
          end;
      ans := ans + min;
      u := tot;
      dist[u] := -1;
    end;
end;

procedure print;
begin
  writeln(ans);
end;

procedure main;
begin
  while not(eof) do
    begin
      init;
      prim;
      print;
    end;
end;

begin
  //assign(input,'aaa.in'); reset(input);
  main;
  //close(input);
end.