POJ 3974 Manacher

题目链接

题意：

求字符串的最长回文子串的长度。

思路：

Manacher。

C++代码：

#include<map>
#include<set>
#include<stack>
#include<cmath>
#include<queue>
#include<vector>
#include<string>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int maxn = 2000010;

char S[maxn],T[maxn];
int p[maxn];

int Manacher( char *s , int *p )
{
    p[0] = 0;
    int len = strlen(s);
    int res = 0,mx = 0,pos;
    for ( int i=1 ; i<len ; i++ )
    {
        if ( i<mx ) p[i] = min( p[pos*2-i] , mx-i );
        else p[i] = 1;
        while ( s[i-p[i]]==s[i+p[i]] ) p[i]++;
        if ( i+p[i]>mx ) mx = i+p[i],pos = i;
        res = max ( res , p[i] );
    }
    return res-1;
}

int main()
{
    for ( int cas=1 ; scanf ( "%s" , S )==1 ; cas++ )
    {
        if ( S[0]=='E' ) break;
        T[0] = '$';
        int len = strlen(S);
        for ( int i=1 ; i<=len ; i++ )
        {
            T[i*2-1] = '#';
            T[i*2] = S[i-1];
        }
        T[len*2+1] = '#';
        T[len*2+2] = '\0';
        printf ( "Case %d: %d\n" , cas , Manacher( T , p ) );
    }
    return 0;
}