KMP之模式匹配

http://acmore.net:8080/contest/view.action?cid=11#problem/D
D - KMP
Time Limit:1000MS     Memory Limit:65536KB     64bit IO Format:%I64d & %I64u
Submit
 
Status
Description
The French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the book:


Tout avait Pair normal, mais tout s’affirmait faux. Tout avait Fair normal, d’abord, puis surgissait l’inhumain, l’affolant. Il aurait voulu savoir où s’articulait l’association qui l’unissait au roman : stir son tapis, assaillant à tout instant son imagination, l’intuition d’un tabou, la vision d’un mal obscur, d’un quoi vacant, d’un non-dit : la vision, l’avision d’un oubli commandant tout, où s’abolissait la raison : tout avait l’air normal mais…


Perec would probably have scored high (or rather, low) in the following contest. People are asked to write a perhaps even meaningful text on some subject with as few occurrences of a given “word” as possible. Our task is to provide the jury with a program that counts these occurrences, in order to obtain a ranking of the competitors. These competitors often write very long texts with nonsense meaning; a sequence of 500,000 consecutive 'T's is not unusual. And they never use spaces.


So we want to quickly find out how often a word, i.e., a given string, occurs in a text. More formally: given the alphabet {'A', 'B', 'C', …, 'Z'} and two finite strings over that alphabet, a word W and a text T, count the number of occurrences of W in T. All the consecutive characters of W must exactly match consecutive characters of T. Occurrences may overlap.


Input
The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format:


One line with the word W, a string over {'A', 'B', 'C', …, 'Z'}, with 1 ≤ |W| ≤ 10,000 (here |W| denotes the length of the string W).
One line with the text T, a string over {'A', 'B', 'C', …, 'Z'}, with |W| ≤ |T| ≤ 1,000,000.
Output
For every test case in the input file, the output should contain a single number, on a single line: the number of occurrences of the word W in the text T.


Sample Input
3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN
Sample Output
1
3
0
kMP算法：目的：为了为了更快地找到模式匹配
要点:在模式中构造next[]数组，next[i]=j,表示当模式串比较到第i位时不等，可以跳到第j位与主串比较
      模式串与主串的匹配

#include<stdio.h>
#include<stdlib.h>
#include<string.h>
#include <iostream>
using namespace std;
const int maxn=1000000+10;
char t[maxn],w[10000+10];
int next[10000+10];
int ans,n,m;
void get_next()
 {
           next[0]=-1;
           int j=-1;
          int i=0;
   while(w[i]!='\0')
  {
           if(j==-1||w[i]==w[j])
            {
                      i++;
                      j++;
                      next[i]=j;
            }
            else
            j=next[j];
  }
}
 int kmp()
  {


         int j=0;
          int i=0;
         while(t[i]!='\0')
          {
           if(j==-1||w[j]==t[i]) 
            {i++;j++;}
            else
            j=next[j];
            if(j==m)
            {ans++;
            j=next[j];
            }
          }
         return ans;
  }
int main()
{   int T,c;
  scanf("%d",&T);
  while(T--)
   {
           scanf("%s",w);
           scanf("%s",t);


           m=strlen(w);
           n=strlen(t);
           ans=0;
        get_next();
           //for(int i=1;i<=m;i++)
           //printf("%d ",p[i]);
           c=kmp();
            printf("%d\n",c);
   }
  // system("pause");
  return 0;
}