qqqq 2008-11-09 16:28:00
点我顶贴
收藏
删除
program qqqqmm;
var father:array[1..10000000]of longint;
i,j,n,a,b:longint;
procedure find(x,y:longint);
begin
if father[x]=father[y] then
begin
writeln(father[x]);
halt;
end;
if father[x]<father[y] then
find(x,father[y]) else
find(father[x],y);
end;
begin
readln(n);
fillchar(father,sizeof(father),$f);
for i:=1 to n-1 do
begin
readln(a,b);
father[b]:=a;
end;
readln(a,b);
if a=b then
writeln(a) else
find(a,b);
end.
第一、二个点不过,请大牛指教