Mai intai trebuie sa te autentifici.
Cod sursa(job #650714)
| Utilizator | Data | 18 decembrie 2011 20:24:01 | |
|---|---|---|---|
| Problema | Subsir crescator maximal | Scor | 10 |
| Compilator | fpc | Status | done |
| Runda | Arhiva educationala | Marime | 0.49 kb |
var f,g:text;
n,i,j,k,max:longint;
v,poz:array[1..100000] of longint;
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]);
poz[n]:=1;
max:=0;
for i:=n-1 downto 1 do begin
poz[i]:=1;
for j:=i to n do if (poz[i]<poz[j]+1)and(v[i]<v[j]) then begin poz[i]:=poz[j]+1; max:=poz[i]; end;
end;
writeln(g,max);
i:=0;
while max>0 do begin
inc(I);
if poz[i]=max then begin
dec(max);
write(g,v[i],' ');
end;
end;
close(g);
end.