LCA（RMQ）

const lx=;
      xh=;
var    L,p,nt:array[..lx*] of longint;
    lt,dfn,fr,dep:array[..lx] of longint;
    f:array[..lx*,..xh] of longint;
    vis:array[..lx] of boolean;
    i,x,y,n,sum,q:longint;
procedure swap(var a,b:longint);
var c:longint;
begin
    c:=a; a:=b; b:=c;
end;
procedure dfs(u:longint);
var i,v:longint;
begin
    inc(sum); dfn[u]:=sum; vis[u]:=true;
    inc(L[]); L[L[]]:=u;
    fr[u]:=L[];
    i:=lt[u];
    while i<> do
    begin
        v:=p[i];
        if not vis[v] then
        begin
            dep[v]:=dep[u]+;
            dfs(v);
            inc(L[]); L[L[]]:=u;
        end;
        i:=nt[i];
    end;
end;
procedure prepare;
var i,j:longint;
begin
    fillchar(fr,sizeof(fr),);
    fillchar(vis,sizeof(vis),false);
    fillchar(L,sizeof(L),);
    sum:=;
        dep[]:=;
    dfs();
    for i:= to L[] do f[i,]:=L[i];
    for i:= to xh do
        for j:= to L[] do
            if j+<<i-<=L[] then
                if dfn[f[j,i-]]<dfn[f[j+<<(i-),i-]] then f[j,i]:=f[j,i-]
                    else f[j,i]:=f[j+<<(i-),i-];
end;
procedure add(x,y:longint);
begin
    inc(sum); p[sum]:=y; nt[sum]:=lt[x]; lt[x]:=sum;
end;
function find(s,t:longint):longint;
var k:longint;
begin
    s:=fr[s]; t:=fr[t];
    if s>t then swap(s,t);
    k:=trunc(ln(t-s+)/ln());
    if dfn[f[s,k]]<dfn[f[t-<<k+,k]] then exit(f[s,k]) else exit(f[t-<<k+,k]);
end;
function dis(s,t:longint):longint;
var k:longint;
begin
    k:=find(s,t);
    exit(dep[t]-dep[k]+dep[s]-dep[k]);
end;
begin
    readln(n);
    fillchar(lt,sizeof(lt),);
    sum:=;
    for i:= to n- do
    begin
        readln(x,y);
        add(x,y);
        add(y,x);
    end;
    prepare;

end.