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.

输入：

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

输出：

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.

样例输入：

3
BAPC
BAPC
AZA
AZAZAZA
VERDI
AVERDXIVYERDIAN

样例输出：

1
3
0

输入两个数组，一个数组W和一个数组T，计算W在T中的出现次数。W的所有连续字符必须与T的连续字符完全匹配。当匹配完成一个之后，把ans++，遍历到T的位置i不变，将j的位置通过net数组使之变成1，如果再匹配成功，则ans++;直到i超出T的范围

#include <iostream>
#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
using namespace std;
const int maxn=1000005;
const int maxx=10005;
char a[maxn],b[maxx];
int net[maxx];
void getnet()
{
    int blen=strlen(b);
    net[0]=-1;
    int k=-1;
    int j=0;
    while(j<blen)
    {
        if(k==-1||b[j]==b[k])
        {
            ++j;
            ++k;
            if(b[j]!=b[k])
                net[j]=k;
            else
                net[j]=net[k];
        }
        else
        {
            k=net[k];
        }
    }
}
int kmpserch()
{
    getnet();
    int i=0;
    int j=0;
    int ans=0;
    int alen=strlen(a);
    int blen=strlen(b);
    while(i<alen)
    {
        if(j==-1||a[i]==b[j])
        {
            i++;
            j++;
        }
        else
        {
            j=net[j];
        }
        if(j==blen)
        {
            ans++;//如果匹配成功，ans++
            j=net[j];//通过net数组让W数组从头开始接着T数组i的位置遍历
        }
    }
    return ans;
}
int main()
{
    int t;
    scanf("%d",&t);
    while (t--)
    {
        scanf("%s",&b);
        scanf("%s",&a);
        printf("%d\n",kmpserch());
    }
    return 0;
}