Manacher算法 & Palindrome

马拉车用于解决最长回文子串问题，重点是子串，而不是子序列，时间复杂度为O(n)。

解释一下变量的意义：

Len[i]数组去存第i个位置到mx位置的长度

id记录上一次操作的位置（这个操作可以看模板）

mx标记上一次的最长子串的最右端

模板：

void init()  //这个是用来处理字符串的
{
    memset(str,0,sizeof(str));
    int k=0;
    str[k++]='$';
    for(int i=0;i<len;++i)
        str[k++]='#',str[k++]=s[i];
    str[k++]='#';
    len=k;
}
int manacher() //求最长回文子串
{
    Len[0]=0;
    int sum=0;
    int id,mx=0;
    for(int i=1;i<len;++i)
    {
        if(i<mx)  Len[i]=min(mx-i,Len[2*id-i]);
        else Len[i]=1;
        while(str[i-Len[i]]==str[i+Len[i]]) Len[i]++;
        if(Len[i]+i>mx)
        {
            mx=Len[i]+i;
            id=i;
            sum=max(sum,Len[i]);
        }
    }
    return (sum-1);
}

当我们要求的以第i个字符为回文字符串的中心的时候，如果i>=mx这个时候没法优化，就是判断(i-1)==(i+1)、(i-2)==(i+2)....一直这样找

看代码就是进行19行、再进行20行

如果i<mx的时候，这个时候

这个时候看一道模板题：

Andy the smart computer science student was attending an algorithms class when the professor asked the students a simple question, "Can you propose an efficient algorithm to find the length of the largest palindrome in a string?"

A string is said to be a palindrome if it reads the same both forwards and backwards, for example "madam" is a palindrome while "acm" is not.

The students recognized that this is a classical problem but couldn't come up with a solution better than iterating over all substrings and checking whether they are palindrome or not, obviously this algorithm is not efficient at all, after a while Andy raised his hand and said "Okay, I've a better algorithm" and before he starts to explain his idea he stopped for a moment and then said "Well, I've an even better algorithm!".

If you think you know Andy's final solution then prove it! Given a string of at most 1000000 characters find and print the length of the largest palindrome inside this string.

Input

Your program will be tested on at most 30 test cases, each test case is given as a string of at most 1000000 lowercase characters on a line by itself. The input is terminated by a line that starts with the string "END" (quotes for clarity).

Output

For each test case in the input print the test case number and the length of the largest palindrome.

Sample Input

abcbabcbabcba
abacacbaaaab
END

Sample Output

Case 1: 13
Case 2: 6

这个时候要注意

不知道是这里memset(Len,0,sizeof(Len)); 导致的超时

还是

void init()
{
    memset(str,0,sizeof(str));
    int k=0;
    str[k++]='$';
    for(int i=0;i<strlen(s);++i) 这个strlen导致的
        str[k++]='#',str[k++]=s[i];
    str[k++]='#';
    len=k;
}

正确代码：

#include<stdio.h>
#include<string.h>
#include<iostream>
#include<algorithm>
#include<set>
using namespace std;
const int maxn=3000005;
const int INF=0x3f3f3f3f;
const int mod=998244353;
char str[maxn],s[maxn];
int len,Len[maxn];
void init()
{
    memset(str,0,sizeof(str));
    int k=0;
    str[k++]='$';
    for(int i=0;i<len;++i)
        str[k++]='#',str[k++]=s[i];
    str[k++]='#';
    len=k;
}
int manacher()
{
    Len[0]=0;
    int sum=0;
    int id,mx=0;
    for(int i=1;i<len;++i)
    {
        if(i<mx)  Len[i]=min(mx-i,Len[2*id-i]);
        else Len[i]=1;
        while(str[i-Len[i]]==str[i+Len[i]]) Len[i]++;
        if(Len[i]+i>mx)
        {
            mx=Len[i]+i;
            id=i;
            sum=max(sum,Len[i]);
        }
    }
    return (sum-1);
}
int main()
{
    int t=0;
    while(~scanf("%s",s))
    {
        //memset(Len,0,sizeof(Len));
        if(strcmp("END",s)==0) break;
        len=strlen(s);
        init();
        printf("Case %d: %d
",++t,manacher());
    }
    return 0;
}