显示代码纯文本
program chen;
var
h:array[1..2,1..100000] of longint;
i,j,k,n:longint;
procedure q(i,j:longint);
begin
if (h[1,i]>=h[1,j]) and (h[2,j]<>0) and (j<=n) then
q(i,h[2,j])
else begin
if h[1,i]<h[1,j] then begin h[2,i]:=j; exit; end
else h[2,j]:=0;
end;
end;
begin
assign(input,'lookup.in'); reset(input);
assign(output,'lookup.out'); rewrite(output);
readln(n);
for i:=1 to n do
readln(h[1,i]);
h[2,n]:=0;
for i:=n-1 downto 1 do begin
k:=0;
q(i,i+1);
end;
for i:=1 to n do
writeln(h[2,i]);
close(input); close(output);
end.