string matching(拓展KMP)

Problem Description

String matching is a common type of problem in computer science. One string matching problem is as following:

Given a string s[0…len−1], please calculate the length of the longest common prefix of s[i…len−1] and s[0…len−1] for each i>0.

I believe everyone can do it by brute force.
The pseudo code of the brute force approach is as the following:

We are wondering, for any given string, what is the number of compare operations invoked if we use the above algorithm. Please tell us the answer before we attempt to run this algorithm.

Input

The first line contains an integer T, denoting the number of test cases.
Each test case contains one string in a line consisting of printable ASCII characters except space.

* 1≤T≤30

* string length ≤106 for every string

Output

For each test, print an integer in one line indicating the number of compare operations invoked if we run the algorithm in the statement against the input string.

Sample Input

3
_Happy_New_Year_
ywwyww
zjczzzjczjczzzjc

Sample Output

17
7
32

代码：

#include<cstdio>

#include<cstring>

#include<iostream>

#include<algorithm>

#include<queue>

#include<stack>

#include<set>

#include<map>

#include<vector>

#include<cmath>

const int maxn=1e6+;

typedef long long ll;

using namespace std;

ll ans;

void pre_EKMP(char x[],int m,ll next[])

{

    next[]=m;

    int j=;

    while(j+<m&&x[j]==x[j+])

    {

        j++;

    }

    next[]=j;

    int k=;

    for(int i=;i<m;i++)

    {

        int p=next[k]+k-;

        int L=next[i-k];

        if(i+L<p+)next[i]=L;

        else

        {

            j=max(,p-i+);

            while(i+j<m&&x[i+j]==x[j])j++;

            next[i]=j;

            k=i;

        }

    }

}

char str[*maxn];

ll nxt[*maxn];

int main()

{

    int T;

    cin>>T;

    while(T--)

    {

        scanf("%s",str);

        int len=strlen(str);

        ans=;

        pre_EKMP(str,len,nxt);

        for(int t=;t<len;t++)

        {

            if(nxt[t]+t<len)

            {

              ans+=(nxt[t]+);

            }

            else

            {

                ans+=(len-t);

            }

        }

    //    ll ans=0;

    printf("%lld\n",ans);

    }

    return ;

}

巴特西

string matching(拓展KMP)

最新文章

热门文章