[1]:=1;T[1]:=0;a[N+1]:=32767;
for i:=2 to N+1 do
begin jmax:=0; L[i]:=1;
for j:=1 to i-1 do
if (a[j]<=a[i])and (L[i]< L[j]+1) then begin
L[i]:=L[j]+1;
jmax:=j;
end;
T[i]:=jmax;
end;End
;Procedure Truyvet(m:integer);Begin
m:=T[m];
if m=0 then exit;truyvet(m);write(g,a[m],' ');end;
minh ko hieu viec so sanh mang l[i] voi l[j] sau nmoi vong gia
tri l[j] la bao nhieu..
va cach truy vet tim nghiem la ngu the nao mimh ko hieu
mn jup minh
thank