Theme Section(字符串的自匹配)

题目

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.

题意

输入N个字符串S,求其中满足S=EAEBE(A,B为任意数目的字符)的子字符串E的最长长度

思路

由于字符串E同时为S的前后缀,我们可以先对字符串S做自匹配,借助next[]数组来求得所有候选项,以此优化搜索程序

代码

#include <iostream>
#include<map>
#include<set>
#include<vector>
#include<algorithm>
#include<string.h>
using namespace std;
char a[1000005]; int  nex[1000005],m;
bool check(int n) {
    //检验在字符串的中间部分是否存在对应的子字符串
    for (int i = n+1, j = 0; i <= m-n; i++) {
        while (j > 0 && (j == n || a[i - 1] != a[j])) j = nex[j];
        if (a[i - 1] == a[j]) j++;
        if (j == n)  return 1;
    }
    return 0;
}
int main()
{
    std::ios::sync_with_stdio(0);
    int n, t; cin >> t;
    while (t--) {
        cin >> a; m = strlen(a);
        //初始化一定要记得
        memset(nex, 0, sizeof(nex));
        nex[1] = 0;
        //对输入字符串作自匹配
        for (int i = 2, j = 0; i <= m; i++) {
            while (j > 0 && a[i - 1] != a[j]) j = nex[j];
            if (a[i - 1] == a[j]) j++;
            nex[i] = j;
        }
        //取前后缀的最长匹配长度
        int N = nex[m];
        while (N) {
            if (check(N)) break;
            //若匹配失败,再利用nex数组得到剩下的最大"候选项"
            N = nex[N];
        }
        cout << N << endl;
    }
    return 0;
}