KMP模板1（便于理解）（poj3461)

KMP模板1（便于理解）（poj3461)

---

优化后的模板（不需要memset)

void get_Next(const string &a,int Next[],int len)
{
    Next[0]=-1;
    int k=-1;
    for(int i=1;i<len;i++)
    {
        while (k>=0 && a[k+1]!=a[i]) k=Next[k];
        if (a[k+1]==a[i])++k;
        Next[i]=k;
    }
}

【题目链接】

Oulipo

Time Limit: 1000MS Memory Limit: 65536K
Total Submissions: 45908 Accepted: 18320

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

---

AC代码

#include <cstdio>
#include <iostream>
#include <cstring>
#include <string>
#include <algorithm>
#define LL long long
using namespace std;

int next[10005];
string a;
void get_next()
{
    int len=a.length();
    int i=1,j=0;
    next[0]=-1;
    for(int i=1;i<len;i++)
    {
        j=next[i-1];
        while(a[j+1]!=a[i])
        {
            if(j==-1)///如果找到头都没有相等那就是-1
            {
                next[i]=-1;
                break;
            }
            else
                j=next[j];
        }
        if(next[i]!=-1) next[i]=j+1;
    }
}
string b;
int main()
{
    //freopen("B:\\acm\\duipai\\data.txt","r",stdin);
    int T;
    cin>>T;
    while(T--)
    {
        cin>>a>>b;
        memset(next,0,sizeof(next));//重要
        get_next();
        int na,nb;
        na=a.length();
        nb=b.length();
        /*for(int i=0;i<na;i++)
        {
            printf("%d ",next[i]);
        }printf("\n");*/
        int i=0,j=0;
        int ans=0;
        while(i<nb)
        {
            if(j<na-1&&a[j]==b[i])///匹配但还没有凑成一个串的时候
            {
                j++;
                i++;
                continue;
            }
            if(j==na-1&&a[j]==b[i])///凑成一个串
            {
                ans++;
                j=next[j]+1;
                i++;
                continue;
            }
            ///剩下是不匹配的情况
            if(j==0)///如果是第一个不匹配直接让i+1
            {
                i++;
                continue;
            }
            j=next[j-1]+1;///不是第一个不匹配调整j
        }
        cout<<ans<<endl;
    }
    return 0;
}