ural1297 求最长回文子串（后缀数组/Manacher算法）

题目：http://acm.hust.edu.cn/vjudge/problem/12406

后缀数组：

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
using namespace std;
#define rep(i,s,t) for(int i=(s);i<(t);i++)
#define per(i,t,s) for(int i=(t);i>=(s);i--)

const int INF = 1e9 + 9;
const int N = 2000 + 9;

/********************倍增算法*后缀数组模板*******************************/


int sa[N], t1[N], t2[N], c[N], rk[N], height[N];
void build_sa (int s[], int n, int m) {
    int i, k, p, *x = t1, *y = t2;
    for (i = 0; i < m; i++) c[i] = 0;
    for (i = 0; i < n; i++) c[x[i] = s[i]]++;
    for (i = 1; i < m; i++) c[i] += c[i - 1];
    for (i = n - 1; i >= 0; i--) sa[--c[x[i]]] = i;
    for (k = 1; k <= n; k <<= 1) {
        p = 0;
        for (i = n - k; i < n; i++) y[p++] = i;
        for (i = 0; i < n; i++) if (sa[i] >= k) y[p++] = sa[i] - k;

        for (i = 0; i < m; i++) c[i] = 0;
        for (i = 0; i < n; i++) c[x[y[i]]]++;
        for (i = 1; i < m; i++) c[i] += c[i - 1];
        for (i = n - 1; i >= 0; i--) sa[--c[x[y[i]]]] = y[i];
        swap (x, y);
        p = 1;
        x[sa[0]] = 0;
        for (i = 1; i < n; i++)
            x[sa[i]] = y[sa[i - 1]] == y[sa[i]] && y[sa[i - 1] + k] == y[sa[i] + k] ? p - 1 : p ++;
        if (p >= n) break;
        m = p;
    }
}
void getHeight (int s[], int n) {
    int i, j, k = 0;
    for (i = 0; i <= n; i++) rk[sa[i]] = i;
    for (i = 0; i < n; i++) {
        if (k) k--;
        j = sa[rk[i] - 1];
        while (s[i + k] == s[j + k]) k++;
        height[rk[i]] = k;
    }
}
/********************************************************************************/

int d[N][20];
void init (int n, int A[]) { //RMQ
    //int n=A.size();
    for (int i = 1; i <= n; i++) d[i][0] = A[i];
    for (int j = 1; (1 << j) <= n + 1; j++)
        for (int i = 0; i + (1 << j) - 1 <= n; i++)
            d[i][j] = min (d[i][j - 1], d[i + (1 << (j - 1) )][j - 1]);
}
int query (int L, int R) {
    int k = 0;
    while ( (1 << (k + 1) ) <= R - L + 1) k++;
    return min (d[L][k], d[R - (1 << k) + 1][k]);
}
int lcp (int a, int b) {
    a = rk[a];
    b = rk[b];
    if (a > b) swap (a, b);
    return query (a + 1, b);
}
int s[N], n;
char str[N];
int main() {
    //freopen ("f.txt", "r", stdin);

    while (~scanf ("%s", str) ) {
        int len = strlen (str);
        rep (i, 0, len) s[i] = str[i];
        s[len] = 1;
        rep (i, 0, len) s[i + len + 1] = str[len - 1 - i];
        n = 2 * len + 1;
        s[n] = 0;
        build_sa (s, n + 1, 128);
        getHeight (s, n);
        init (n, height);
        //for(int i=1;i<=n;i++)printf("%d ",sa[i]);printf("\n");
        //for(int i=1;i<=n;i++)printf("%d ",height[i]);printf("\n");

        int ans = 0, pos;
        for (int i = 0; i < len; i++) {
            int t = lcp (i, n - i);
            if (2 * t > ans) {
                ans = 2 * t;
                pos = i - t;
            }
            t = lcp (i, n - i - 1);
            if (2 * t - 1 > ans) {
                ans = 2 * t - 1;
                pos = i - t + 1;
            }
        }
        str[pos + ans] = 0;
        printf ("%s\n", str + pos);
    }
    return 0;
}
/*
input
ThesampletextthatcouldbereadedthesameinbothordersArozaupalanalapuazorA

output
ArozaupalanalapuazorA

*/

当然这题Manacher 算法更简单：
Manacher算法看这篇博客：http://blog.csdn.net/xingyeyongheng/article/details/9310555

#include<bits/stdc++.h>

using namespace std;
const int N = 2e3 + 9;
/*****************Manacher算法模板*************/
int p[N];
int Manacher (char s[], int len, int& pos) { 
    //pos保存最长回文串中心位置，函数返回最长回文串长度
    int maxn = 0, id = 0;
    for (int i = len; i >= 0; i--) {
        s[i * 2 + 2] = s[i];
        s[i * 2 + 1] = '#';
    }
    s[0] = '$';
    for (int i = 2; i < 2 * len + 1; i++) {
        if (p[id] + id > i) p[i] = min (p[2 * id - i], p[id] + id - i);
        else p[i] = 1;
        while (s[i - p[i]] == s[i + p[i]])++p[i];
        if (id + p[id] < i + p[i]) id = i;
        if (maxn < p[i]) maxn = p[i], pos = i;
    }
    return maxn - 1;
}
/*************************************************/
char str[N];
int main() {
    //freopen("f.txt","r",stdin);
    while (~scanf ("%s", str) ) {
        int n = strlen (str), pos;
        int len = Manacher (str, n, pos);
        for (int i = pos - len; i <= pos + len; i++)
            if (str[i] != '#') printf ("%c", str[i]);
        printf ("\n");
    }
    return 0;
}
/*
input
ThesampletextthatcouldbereadedthesameinbothordersArozaupalanalapuazorA

output
ArozaupalanalapuazorA

*/