kmp- Oulipo-模式串主串匹配问题

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

题意：t组典例，每组第一行表示模式串，第二组表示主串，求在主串里能找到多少模式串；

题解：kmp，用nex数组求出模式串的nex值，然后在主串中进行匹配；

代码如下：

Select Code

#include<stdio.h>
#include<string.h>
#include<algorithm>
#define N 1000001
using namespace std;
int nex[N];
char text[N],pattern[N];//分别是主串，模式串
void getnex()//用模式串求next数组
{
    int i,j=0;
    nex[0]=0;
    nex[1]=0;
    for(i=1;i<strlen(pattern);i++)
    {
        j=nex[i];
        while(j&&pattern[i]!=pattern[j])
        {
            j=nex[j];
        }
        nex[i+1]=pattern[i]==pattern[j]?j+1:0;
    }
}
int kmp()//字符串匹配
{
    int l1,l2,j=0,ans=0,i;
    l1=strlen(pattern);
    l2=strlen(text);
    for(i=0;i<l2;i++)
    {
        while(j&&pattern[j]!=text[i])//发生失配
        {
            j=nex[j];
        }
        if(pattern[j]==text[i])//字符匹配成功
            j++;
        if(j==l1)
            ans++;
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
   while(t--)
   {
       scanf("%s %s",pattern,text);
       getnex();
       int d=0;
       d=kmp();
       printf("%d\n",d);
   }
   return 0;
}