Oulipo POJ - 3461 kmp模板题 熟悉一下

A - Oulipo POJ - 3461
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

#include<stdio.h>
#include<string.h>
using namespace std;
typedef long long ll;
const int mc=1e4+5;
const int maxn=1e6+5;
char str[maxn],pattern[mc];
int PI[mc];
void cpf(char *p)  //设置Next数组
{
    int m=strlen(p);
    PI[0]=-1,PI[1]=0;
    for(int i=1;i<m;i++)        
    {
        int j=PI[i];
        while(j>0&&p[i]!=p[j])   
            j=PI[j];
        if(p[i]==p[j])
            PI[i+1]=j+1;
            else PI[i+1]=0;
    }
    
}
void kmp(char *s,char *p)
{
    int num=0;
    int slen=strlen(s),plen=strlen(p);
    int j=0;
    cpf(p);
    for(int i=0;i<slen;i++)
    {
        while(j>0&&p[j]!=s[i])         //匹配失效
            j=PI[j];
        if(p[j]==s[i]) j++;
        if(j==plen)
        {
            num++;
        }
    }printf("%d\n",num);
}
int main()
{
    
    int Test;
    scanf("%d",&Test);
    while(Test--)
    {
    	memset(PI,0,sizeof(PI));
        scanf("%s%s",pattern,str);
        kmp(str,pattern);
    }
    return 0;
}