tyvj1033

朴素搜索

一条过了，又一道一条过的

怎么打得简洁怎么来

skysun原创，转载请注明出处，http://www.cnblogs.com/skysun

program sky;
var
   i,j,x : longint;
   n     : longint;
   a     : array[0..1001,1..2] of longint;
   f     : array[0..1001] of longint;
function max(qq,ww: longint ):longint;
begin
   if qq>ww then exit(qq); exit(ww);
end;
procedure dfs(x       : longint );
begin
   if x=0 then exit;
   if a[x,1]<>0 then f[a[x,1]]:=f[x]+1 else f[0]:=max(f[0],f[x]+1);
   dfs(a[x,1]);
   if a[x,2]<>0 then f[a[x,2]]:=f[x]+1 else f[0]:=max(f[0],f[x]+1);
   dfs(a[x,2]);
end;
begin
   read(n);
   for i:=1 to n-1 do
   begin
      read(x);
      read(a[x,1],a[x,2]);
   end;
   dfs(1);
   writeln(f[0]);
end.