bzoj1212

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

 var can,f:array[..] of boolean;
     son:array[..,..] 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:=;
     for i:=l downto  do
     begin
       x:=ord(s[i])-;
       if son[p,x]=- 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:=;
     while j> do
     begin
       x:=ord(ss[j])-;
       if son[p,x]=- 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:=;
   fillchar(son,sizeof(son),);
   for i:= to n do
   begin
     readln(s);
     add(s);
   end;
   for i:= to m do
   begin
     readln(ss);
     l:=length(ss);
     fillchar(f,sizeof(f),false);
     ans:=;
     f[]:=true;
     for j:= to l do
     begin
       f[j]:=ask(j);
       if f[j] then ans:=j;
     end;
     writeln(ans);
   end;
 end.