Cod sursa(job #903156)
Utilizator | Data | 1 martie 2013 18:48:46 | |
---|---|---|---|
Problema | Subsir crescator maximal | Scor | 0 |
Compilator | fpc | Status | done |
Runda | Arhiva educationala | Marime | 1.05 kb |
program subsir_de_lungime_maxima;
type vector=array[0..100000] of longint;
var v,l:vector;
i,n,k,max,t:longint;
f,g:text;
begin
assign(f,'scmax.in');reset(f);
assign(g,'scmax.out');rewrite(g);
readln(f,n);
for i:=1 to n do read(f,v[i]);
l[n]:=1; v[0]:=2000000000;
max:=0;
for i:=n-1 downto 0 do
begin
l[i]:=1;
for k:=i+1 to n do if (v[k]>=v[i])and(l[k]>l[i]+1)then begin
l[i]:=l[k]+1;
if l[i]>max then begin
max:=l[i];
t:=i;
end;
end;
end;
writeln(g,max);
for i:=t+1 to n do
if (v[i]>=v[t])and(l[i]=max-1) then begin
write(g,v[i],' '); dec(max);
end;
close(f);close(g);
end.