（kuangbin带你飞--kmp）Theme Section

最新推荐文章于 2020-07-26 11:07:28 发布

deebcjrb

最新推荐文章于 2020-07-26 11:07:28 发布

阅读量96

点赞数

分类专栏： KMP 文章标签： kmp

本文链接：https://blog.csdn.net/weixin_43791787/article/details/98768823

版权

KMP 专栏收录该内容

12 篇文章 0 订阅

订阅专栏

原题目：

It's time for music! A lot of popular musicians are invited to join us in the music festival. Each of them will play one of their representative songs. To make the programs more interesting and challenging, the hosts are going to add some constraints to the rhythm of the songs, i.e., each song is required to have a 'theme section'. The theme section shall be played at the beginning, the middle, and the end of each song. More specifically, given a theme section E, the song will be in the format of 'EAEBE', where section A and section B could have arbitrary number of notes. Note that there are 26 types of notes, denoted by lower case letters 'a' - 'z'.

To get well prepared for the festival, the hosts want to know the maximum possible length of the theme section of each song. Can you help us?

Input

The integer N in the first line denotes the total number of songs in the festival. Each of the following N lines consists of one string, indicating the notes of the i-th (1 <= i <= N) song. The length of the string will not exceed 10^6.

Output

There will be N lines in the output, where the i-th line denotes the maximum possible length of the theme section of the i-th song.

Sample Input

5
xy
abc
aaa
aaaaba
aaxoaaaaa

Sample Output

中文概要：

给定一个字符串，长度在10^6之内，让这个字符串去匹配EAEBE形式的串，其中AB是任意长度的串（可为0），求E串最长是多少。


#include<stdio.h>
#include<string.h>
#include<string>
#include<algorithm>
#include<math.h>
#include<map>
#include<queue>
#include<vector>
#include<stack>
#define inf 0x3f3f3f3f
using namespace std;
typedef long long ll;
const int N=1000005;
char s[N];
int Next[N],l;
void get_Next()
{
    int i=0,j=-1;
    Next[0]=-1;
    while(i<l)
    {
       if(j==-1||s[i]==s[j])
            Next[++i]=++j;
        else
            j=Next[j];
    }
}
int KMP()
{
    int i,j;
    for(i=Next[l]; i; i=Next[i])
        for(j=2*i; j<=l-i; j++)
            if(Next[j]==i)
                return i;
    return 0;
}
int main()
{
    int T;
    scanf("%d",&T);
    while(T--)
    {
        scanf("%s",s);
        int ans=0,k,i,j;
        l=strlen(s);
        get_Next();
        printf("\n");
        printf("%d\n",KMP());
    }
    return 0;
}

思路：首先求出给定主串的next数组，可以确定的是，若主串符合EAEBE形式，那么设next[len]==i，则在范围j属于[2*i, len-i]范围内一定有next[j]==i，这样题目就可解了。

虽然我也不知道为啥。。。看了半天不知道为啥