POJ 3461 裸的KMP

直接贴代码吧

 #include<cstdio>
 #include<cstring>
 char P[],T[];
 int f[];
 int n,m;
 void getfail()
 {
     f[] = ;
     f[] =;
     for(int i=; i<m; ++i)
     {
         int j=f[i];
         while(j && P[i] != P[j]) j = f[j];
         f[i+] = P[i]==P[j] ? j+:;
     }
 }
 int KMP()
 {
     int cnt=;
     getfail();
     int j=;
     for(int i=; i<n; ++i)
     {
         while(j && P[j] != T[i]) j=f[j];
         if(P[j] == T[i])  ++j;
         if(j == m)
         {
             j=f[m];
             ++cnt;
         }
     }
     return cnt;
 }
 int main()
 {
     freopen("in.txt","r",stdin);
     int t;
     scanf("%d",&t);
     while(t--)
     {
         scanf("%s%s",P,T);
         n=strlen(T);
         m = strlen(P);
         getfail();
         for(int i=; i<=m; ++i)
             printf("%d\n",f[i]);
     }
     return ;
 }