const
  MaxN = 1000;
var
  a,b : array[1..MaxN] of char;
  f : array[0..MaxN,0..MaxN] of integer;
  ch : char;
  lena,lenb,i,j : integer;

function max(x,y : integer) : integer;
begin
  if x > y then max := x else max := y;
end;

begin
  while not eof(input) do begin
    fillchar(a,sizeof(a),0); fillchar(b,sizeof(b),0);
    read(ch);  while ch = ' ' do read(Ch); lena := 0;
    while ch <> ' ' do begin
      inc(lena); a[lena] := ch; read(ch);
    end;
    while ch = ' ' do read(ch); lenb := 0;
    while ch <> ' ' do begin
      inc(lenb); b[lenb] := ch;
      if not eoln(input) then read(Ch) else break;
    end;
    readln;
    fillchar(f,sizeof(f),0);
    for i := 1 to lena do
    for j := 1 to lenb do begin
      f[i,j] := max(f[i - 1,j],f[i,j - 1]);
      if a[i] = b[j] then inc(f[i,j]);
    end;
    writeln(f[lena,lenb]);
  end;
end.

• Re:WA了 (21) nobody_is_me 2006-02-03 19:21:02