BZOJ P1083 繁忙的都市

  传送门 ： http://www.lydsy.com/JudgeOnline/problem.php?id=1083

  

  比较简单的题  直接用Kruskal做一遍最小生成树，将最后加进去的边输出即可。

 

   下面附上代码：

//By Neil
var
   n,m                          :longint;
   c                            :array[0..10000] of longint;
   l,r                          :array[0..10000] of longint;
   f                            :array[0..10005] of longint;
   min                          :longint;
   i,j                          :longint;
   x,y                          :longint;
 
procedure  swap(var a,b:longint);
  var
    temp                   :longint;
  begin
    temp:=a;
    a:=b;
    b:=temp;
  end;
procedure  qsort(x,y:longint);
  var
     i,j,k              :longint;
  begin
    i:=x;
    j:=y;
    k:=c[ (i+j) div 2];
    repeat
      while c[i]<k do inc(i);
      while c[j]>k do dec(j);
      if i<=j then
        begin
          swap(l[i],l[j]);
          swap(r[i],r[j]);
          swap(c[i],c[j]);
          inc(i);
          dec(j);
        end;
    until i>j;
    if i<y then qsort(i,y);
    if j>x then qsort(x,j);
  end;
 
function  getfather(x:longint):longint;
 begin
   if f[x]=x then exit(x);
   f[x]:=getfather(f[x]);
   exit(f[x]);
 end;
 
procedure  init;
  begin
   read(n,m);
   for i:=1 to n do
     f[i]:=i;
   for i:=1 to m do
     read(l[i],r[i],c[i]);
   qsort(1,m);
  end;
 
procedure  main;
  var
    x,y                 :longint;
    a,b                 :longint;
    i                   :longint;
  begin
    for i:=1 to m do
      begin
        a:=l[i];
        b:=r[i];
        x:=getfather(a);
        y:=getfather(b);
        if x<>y then
          begin
            f[x]:=y;
            min:=c[i];
          end;
      end;
 
 
  writeln(n-1,' ',min);
  end;
 
begin
  init;
  main;
end.