Theme Section HDU - 4763 (kmp)

最新推荐文章于 2021-12-04 21:35:15 发布

原创最新推荐文章于 2021-12-04 21:35:15 发布 · 315 阅读

0 ·

CC 4.0 BY-SA版权

KMP 专栏收录该内容

16 篇文章

订阅专栏

本文介绍了一种算法，用于寻找音乐节表演歌曲中最大可能长度的主题部分。通过使用Next数组来确定最长前后缀，并借助KMP算法验证中间部分是否包含该主题，最终实现了对每首歌最大主题长度的有效计算。

Theme Section

HDU - 4763

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

利用Next数组，这样最长前后缀就得到了，然后只需要用kmp在看一下中间部分是否有这一段字符串就可以了

code：

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
const int MAXN = 1e6+100;
char s[MAXN];
int Next[MAXN];
void getNext(){
    int i = -1,j = 0;
    int len = strlen(s);
    Next[0] = -1;
    while(j < len){
        if(i == -1 || s[i] == s[j]){
            i++,j++;
            Next[j] = i;
        }
        else
            i = Next[i];
    }
}
bool kmp(int st){
    int i = 0,j = st;
    int n = strlen(s);
    while(j < n-st){
        if(i == -1 || s[i] == s[j])
            i++,j++;
        else
            i = Next[i];
        if(i == st)
            return true;
    }
    return false;

}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        int i,j,len,Max = 0;
        scanf("%s",s);
        len = strlen(s);
        if(len < 3){
            printf("0\n");
            continue;
        }
        getNext();
        while(Next[len] != -1){
            if(Next[len] > Max && kmp(Next[len])){
                Max = Next[len];
                break;
            }
            len = Next[len];
        }
        printf("%d\n",Max);
    }
    return 0;
}