（Palindrome）各种计算最长回文字串的方法实现及分析

Palindrome URAL - 1297

1，刚学的后缀数组 时间复杂度O(nlog(n))
空间复杂度O(n)
eg ：计算 “vababa”的最长回文字串
先加上特殊字符分割防止这个位置有公共前缀，然后再加上该字符的串逆序。
生成 “vababa#vababa” 下标从1开始
然后求出后缀数组的sa, heigh数组， 用倍增的方法查询第l个后缀和第r个后缀的最长公共前缀

然后遍历1~n, 分奇偶回文串讨论即可
奇：vababa#ababav 的公共前缀 即 $LCP(i,n-i+1)\ast 2-1$(共用了s[4])
偶：vababa#ababav 即$LCP(i,n-i+2)\ast 2$
这个字符串的最大值
细节见于代码

#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;
#define ll long long
const int N = 20010;

int n, m;
char s[N];
int sa[N], x[N], y[N], c[N], rk[N], height[N], base[N], f[N][20];
void get_sa()
{
    for (int i = 1; i <= n; i ++ ) c[x[i] = s[i]] ++ ;
    for (int i = 2; i <= m; i ++ ) c[i] += c[i - 1];
    for (int i = n; i; i -- ) sa[c[x[i]] -- ] = i;
    for (int k = 1; k <= n; k <<= 1)
    {
        int num = 0;
        for (int i = n - k + 1; i <= n; i ++ ) y[ ++ num] = i;
        for (int i = 1; i <= n; i ++ )
            if (sa[i] > k)
                y[ ++ num] = sa[i] - k;
        for (int i = 1; i <= m; i ++ ) c[i] = 0;
        for (int i = 1; i <= n; i ++ ) c[x[i]] ++ ;
        for (int i = 2; i <= m; i ++ ) c[i] += c[i - 1];
        for (int i = n; i; i -- ) sa[c[x[y[i]]] -- ] = y[i], y[i] = 0;
        swap(x, y);
        x[sa[1]] = 1, num = 1;
        for (int i = 2; i <= n; i ++ )
            x[sa[i]] = (y[sa[i]] == y[sa[i - 1]] && y[sa[i] + k] == y[sa[i - 1] + k]) ? num : ++ num;
        if (num == n) break;
        m = num;
    }
}

void get_height()
{
    for (int i = 1; i <= n; i ++ ) rk[sa[i]] = i;
    for (int i = 1, k = 0; i <= n; i ++ )
    {
        if (rk[i] == 1) continue;
        if (k) k -- ;
        int j = sa[rk[i] - 1];
        while (i + k <= n && j + k <= n && s[i + k] == s[j + k]) k ++ ;
        height[rk[i]] = k;
    }
}

void init_rmq()
{
	base[0] = -1;
	for(int i = 1; i <= n; i ++)
	{
		f[i][0] = height[i];
		base[i] = base[i>>1] + 1;
	}
	for(int j = 1; j <= 18; j ++)
	{
		for(int i = 1; i + (1 << (j - 1)) <= n; i++)
		{
			f[i][j] = min(f[i][j - 1], f[i + (1 << (j - 1))][j - 1]);
		}
	}
}
int LCP(int x, int y) //第x和第y个后缀(不是排名)的最长公共前缀
{
	if(x == y) return n - x + 1;
	x = rk[x], y = rk[y];
	if(x > y) swap(x, y);
	x ++;
	int t = base[y - x + 1];
	return min(f[x][t], f[y - (1 << t) + 1][t]);
}
void init()
{
	memset(c, 0, sizeof c);
	memset(x, 0, sizeof x);
}
int main()
{
	init();
	scanf("%s",s + 1);
	n = strlen(s + 1);
	s[n + 1] = '#';
	for(int i = n + 2, len = 0; i <= 2 * n + 1; i ++, len ++)
		s[i] = s[n - len];
	int n1 = n;
	n = n1 * 2 + 1;
	s[n + 1] = '\0';
	m = 200;
	get_sa();
	get_height();
	init_rmq();
	int ans = 1;
	int id = 1;
//	cout << s + 1<< endl;
//	cout << n << endl;
//	cout << "height = ";
//	for(int i = 1; i <= n; i++) cout << height[i] << " " ;
//	cout << endl;
//	cout << "sa = ";
//	for(int i = 1; i <= n; i++) cout << sa[i] << " " ;
//	cout << endl;
//	for(int i = 1; i <= n; i++)
//	{
//
//		for(int j = sa[i]; j <= n; j ++) cout << s[j];
//		cout << endl;
//	}
	for(int i = 1; i <= n1; i ++)
	{
		int t1 = LCP(i, n - i + 1) * 2 - 1;// 奇数回文串
		int t2 = LCP(i, n - i + 2) * 2; //偶数回文串
		//cout << t1 << " " << t2 << endl;
		if(ans < t1)
		{
			ans = t1;
			id = i - ((t1 + 1) / 2 - 1);
		}
		if(ans < t2)
		{
			ans = t2;
			id = (i - t2 / 2);
		}
	}
	for(int i = id; i < id + ans; i ++) cout << s[i];
    return 0;
}

2，区间dp 时间复杂度O($n^2$) 空间复杂度O($n^2$)

#include<bits/stdc++.h>

using namespace std;

const int N = 1e3 + 10;
int dp[N][N];
char s[N];
int main()
{
    scanf("%s",s + 1);
    int n = strlen(s + 1);
    int maxx = 1;
    int l = 1, r = 1;
    for(int i = 1; i <= n; i ++) dp[i][i] = 1;
    for(int i = 1; i < n; i++)
        if(s[i] == s[i + 1])
        {
            if(maxx != 2)
            {
                l = i, r = i + 1;
                maxx = 2;
            }
            dp[i][i + 1] = 2;
        }

    for(int i = 2; i < n; i ++)
    {
        for(int j = 1; j + i <= n; j ++)
        {
            int k = j + i;
            if(dp[j + 1][k - 1] != 0 && s[j] == s[k])
            {
                dp[j][k] = i + 1;
                if(dp[j][k] > maxx)
                {
                    maxx = dp[j][k];
                    l = j, r = k;
                }
            }
        }
    }
    for(int i = l; i <= r; i++) cout << s[i];
}

3,manache(马拉车) 时间/空间复杂度都是O(n)

#include<bits/stdc++.h>

using namespace std;
const int N = 1e4;
int cnt;
string tmp, s(3000, '0');
void get_s()//得到转变后的字符串数组
{
	int len = tmp.size();// 原串
	s[cnt ++] = 'L'; // 不相关的字符
	for(int i = 0; i < len; i++)
	{
		s[cnt ++] = '#';
		s[cnt ++] = tmp[i];
	}
	s[cnt ++] = '#';
	s[cnt] = '0'; // 防止越界
}

int r[N*2];

int manacher()
{
	get_s();
	r[0] = 0;
	int mx = 0, id, maxx = 0;
	// mx为之前匹配到的最右边的点
	//id 为最长回文串的中点
	//maxx为最长回文串的长度
	//s[cnt + 1] = '\0';
	//cout << s << endl;
	//int l = 1, r = 1;
	int m_id = 1;
	for(int i = 1; i < cnt; i++)
	{
		if(i < mx)
			r[i] = min(r[id - (i - id)], mx-i); // 对称位置的最远处
		else r[i] = 1;
		while(s[i + r[i]] == s[i - r[i]]) r[i] ++;//还可以继续延申
		if(i + r[i] > mx)//更新mx
		{
			mx = i + r[i], id = i;
		}
		if(r[i] > maxx)
		{
			m_id = i;
			maxx = r[i];
		}
	}
	maxx --;
	int t;
	if(m_id % 2 == 0)
	{
		t = m_id / 2 - 1 - maxx / 2;//奇数串
	}
	else t = m_id / 2 - maxx / 2; // 偶数串
	for(int i = t, j = 0; j < maxx; j ++, i ++) cout << tmp[i];
	return maxx;
}

int main()
{
	getline(cin, tmp);
	manacher();
}