[hdu2222] [AC自动机模板] Keywords Search [AC自动机]

AC自动机模板，注意！ch,Fail,lab数组的大小不是n而是节点个数，需要认真计算！

 #include <iostream>
 #include <algorithm>
 #include <cstdio>
 #include <cstring>
 #include <cmath>
 #include <ctime>
 #include <cstdlib>
 #include <queue>

 using namespace std;

 int    cnt;
 int    ch[][],Fail[],lab[];
 char    str[],S[];

 void    Add(const char * s)
 {
     int    p=,i;
     for(i=;s[i];++i)
     {
         if(!ch[p][s[i]-])ch[p][s[i]-]=++cnt;
         p=ch[p][s[i]-];
     }
     lab[p]++;
     return ;
 }

 void    Build()
 {
     int    i,t;
     queue<int>    Q;
     Q.push();
     while(!Q.empty())
     {
         t=Q.front();Q.pop();
         for(i=;i<;++i)
         {
             if(ch[t][i])
             {
                 Q.push(ch[t][i]);
                 Fail[ch[t][i]]=t?ch[Fail[t]][i]:;
             }
             else    ch[t][i]=ch[Fail[t]][i];
         }
     }
     return ;
 }

 int main()
 {
     int    T,n,i;

     scanf("%d",&T);
     while(T--)
     {
         memset(Fail,,sizeof(Fail));
         memset(ch,,sizeof(ch));
         memset(lab,,sizeof(lab));
         cnt=;
         scanf("%d",&n);
         for(i=;i<=n;++i)
         {
             scanf("%s",str+);
             Add(str);
         }
         Build();
         scanf("%s",S+);
         int    p=,Ans=;
         for(i=;S[i];++i)
         {
             p=ch[p][S[i]-];
             if(lab[p])
             {
                 int    pp=p;
                 while(pp)Ans+=lab[pp],lab[pp]=,pp=Fail[pp];
             }
         }
         printf("%d\n",Ans);
     }

     return ;
 }