LIQ – spoj

program      LIQ;
var    n,res,i,j:longint;
a,f:array[1..1009] of longint;
begin
readln(n);
res:=0;
for i:=1 to n do
begin
read(a[i]);
f[i]:=1;
for j:=1 to i-1 do
if (a[i]>a[j]) and (f[j]+1>f[i]) then f[i]:=f[i]+1;
if f[i]>res then res:=f[i];
end;
writeln(res);
end.

program LIQ; var n,res,i,j:longint; a,f:array[1..1009] of longint; begin readln(n); res:=0; for i:=1 to n do begin read(a[i]); f[i]:=1; for j:=1 to i-1 do if (a[i]>a[j]) and (f[j]+1>f[i]) then f[i]:=f[i]+1; if f[i]>res then res:=f[i]; end; writeln(res); end.