Oulipo（KMP）

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
题意
给你两个数组，B和A，问，B在A中出现的次数（可重叠）

解析：

字符串匹配问题，需要注意的是，可重叠这一特性。
KMP算法主要是对字符串B进行操作
对于字符串匹配问题，还有不重叠的形式，不难调整。

同类题：Number Sequence HDU - 1711 （找第B一次出现的位置）

注意：
输入不要用cin，会超时。

#include<stdio.h>
#include<iostream>
#include<string.h>
#define N 1000010
using namespace std;
char a[N],b[10010];
int p[10010],n,m;


void pre()
{
    p[1]=0;
    int j=0;
    for(int i=1;i<m;i++)
    {
        while(j>0&&b[j+1]!=b[i+1])
            j=p[j];
        if(b[j+1]==b[i+1])j++;
        p[i+1]=j;
    }
}
int kmp()
{
    int ans=0,j=0;
    for(int i=0;i<n;i++)
    {
        while(j>0&&b[j+1]!=a[i+1])
            j=p[j];
        if(b[j+1]==a[i+1])j++;
        if(j==m)
        {
            ans++;
            j=p[j];

        }
    }
    return ans;
}
int main()
{
    int t,i,j,s;
    scanf("%d",&t);
    getchar();
    while(t--)
    {
        memset(a,0,sizeof(a));
        memset(b,0,sizeof(b));
        memset(p,0,sizeof(p));
        scanf("%s",b+1);
        scanf("%s",a+1);
        m=strlen(b+1);
        n=strlen(a+1);
        pre();s=kmp();
        printf("%d\n",s);
    }
    return 0;
}