bzoj1212

trie树最基本的应用了
不难得到f[i]=f[j] if (s[j+1~i]∈dictionary);
可以用trie树匹配

var can,f:array[0..1000010] of boolean;
    son:array[0..1000010,1..26] of longint;
    j,l,i,t,n,m,ans:longint;
    ss:ansistring;
    s:string;

procedure add(s:string);
  var i,l,p,x:longint;
  begin
    l:=length(s);
    p:=1;
    for i:=l downto 1 do
    begin
      x:=ord(s[i])-96;
      if son[p,x]=-1 then
      begin
        inc(t);
        son[p,x]:=t;
      end;
      p:=son[p,x];
    end;
    can[p]:=true;
  end;

function ask(j:longint):boolean;
  var i,p,x:longint;
  begin
    p:=1;
    while j>0 do
    begin
      x:=ord(ss[j])-96;
      if son[p,x]=-1 then exit(false);
      p:=son[p,x];
      dec(j);
      if f[j] and can[p] then exit(true);
    end;
    exit(false);
  end;

begin
  readln(n,m);
  t:=1;
  fillchar(son,sizeof(son),255);
  for i:=1 to n do
  begin
    readln(s);
    add(s);
  end;
  for i:=1 to m do
  begin
    readln(ss);
    l:=length(ss);
    fillchar(f,sizeof(f),false);
    ans:=0;
    f[0]:=true;
    for j:=1 to l do
    begin
      f[j]:=ask(j);
      if f[j] then ans:=j;
    end;
    writeln(ans);
  end;
end.