【Manacher Algorithm】POJ 3974 Palindrome(模板)

 POJ 3974 Palindrome

• 求字符串最长回文的长度。
• 因为时间限制，所以考虑时间复杂度为O(n)的Manacher算法。

Manacher详解+例题

#include <iostream>
#include <cstdio>
#include <cmath>
#include <string>
#include <cstring>
#include <algorithm>
#include <limits>
#include <vector>
#include <stack>
#include <queue>
#include <set>
#include <map>
#define INF 0x3f3f3f3f
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
const int maxN = 1000000 + 7;
int Manacher(char *s)
{
    string t = "$#";
    int len = strlen(s);
    for(int i = 0; i < len; i ++ ) { t += s[i]; t += '#'; }
    len = t.size();
    vector<int>radius(len, 0);
    int mx = 0, id = 0;
    int Center = 0, Len = 0;
    for(int i = 1; i < len; i ++ )
    {
        radius[i] = mx > i ? min(radius[(id << 1) - i], mx - i) : 1;
        while(i + radius[i] < len && i - radius[i] >= 0 && t[i + radius[i]] == t[i - radius[i]])
            ++ radius[i];
        if(Len < radius[i])
        {
            Len = radius[i];
            Center = i;
        }
        if(mx < radius[i] + i)
        {
            mx = radius[i] + i;
            id = i;
        }
    }
    return Len - 1;
}
char s[maxN];
int main()
{
    int Cas = 0;
    while(~scanf("%s", s) && strcmp(s, "END") != 0)
    {
        printf("Case %d: %d\n", ++Cas, Manacher(s));
    }
    return 0;
}