Cod sursa(job #264391)

Utilizator philipPhilip philip Data 21 februarie 2009 23:12:55
Problema Cel mai lung subsir comun Scor 0
Compilator fpc Status done
Runda Arhiva educationala Marime 0.67 kb
var f,g:text;
    n,m,i,j,k:integer;
    a,b:array[1..1024] of byte;
    c:array[0..1024,0..1024] of byte;

begin
  assign(f,'cmlsc.in');
  reset(f);
  assign(g,'cmlsc.out');
  rewrite(g);
  readln(f,n,m);
  for i:=1 to n do read(f,a[i]);
  readln(f);
  for i:=1 to m do read(f,b[i]);
  close(f);
  for i:=1 to n do
    for j:=1 to n do if a[i]=b[j] then c[i,j]:=c[i-1,j-1]+1
      else if c[i-1,j]>c[i,j-1] then c[i,j]:=c[i-1,j] else
        c[i,j]:=c[i,j-1];
  writeln(g,c[n,m]);
  repeat
    if a[i]=b[j] then begin k:=k+1; write(a[i],' '); i:=i-1; j:=j-1; end
      else if c[i-1,j]<c[i,j-1] then j:=j-1 else i:=i-1;
  until k=c[n,m];
  close(g);
end.