ural1297 Palindrome

题面在这里

题意：

求一个串最长的回文子串。

做法：

首先将原串和它的反串用一个没有出现过的字符拼接起来。
跑这个大串的sa。求出height。
在原串中枚举一个中心点x，要知道x往左右两边最多能扩展多少，这个相当于求原串和反串相应后缀的lcp。
于是就可以用height+rmq实现了。
注意要按照长度奇偶分开讨论。

代码：

/*************************************************************
    Problem: ural 1297 Palindrome
    User: fengyuan
    Language: C++
    Result: Accepted
    Time: 1 ms
    Memory: 0.6 MB
    Submit_Time: 2018-01-18 18:30:34
*************************************************************/

#include<cstdio>
#include<cstring>
#include<algorithm>
#include<iostream>
#include<cstdlib>
#include<cctype>
#include<cmath>
using namespace std;

const int N = 10010;
int n, m, all;
char s1[N], s[N];
int sa[N], tp[N], rk[N], tong[N], h[N][15];

inline void ssort() {
    for(int i = 0; i <= all; i ++) tong[i] = 0;
    for(int i = 1; i <= n; i ++) tong[rk[tp[i]]] ++;
    for(int i = 1; i <= all; i ++) tong[i] += tong[i-1];
    for(int i = n; i >= 1; i --) sa[tong[rk[tp[i]]] --] = tp[i];
}
inline void get_sa() {
    for(int i = 1; i <= n; i ++) rk[i] = s[i], tp[i] = i;
    all = 127; ssort(); int w = 1; all = 1;
    while(all < n) {
        int t = 0;
        for(int i = n-w+1; i <= n; i ++) tp[++ t] = i;
        for(int i = 1; i <= n; i ++) if(sa[i]>w) tp[++ t] = sa[i]-w;
        ssort(); for(int i = 1; i <= n; i ++) tp[i] = rk[i];
        rk[sa[1]] = all = 1;
        for(int i = 2; i <= n; i ++) rk[sa[i]] = (tp[sa[i]] == tp[sa[i-1]] && tp[sa[i]+w] == tp[sa[i-1]+w])?all:++ all;
        w <<= 1;
    } int k = 0;
    for(int i = 1; i <= n; i ++) {
        if(k) k --; int j = sa[rk[i]-1];
        for(; i+k <= n && j+k <= n && s[i+k] == s[j+k]; k ++);
        h[rk[i]][0] = k;
    }
}
inline int qry(int x, int y) {
    x = rk[x], y = rk[y];
    if(x > y) swap(x, y); x ++;
    int k = 0;
    while((1<<k+1) <= y-x+1) k ++;
    return min(h[x][k], h[y-(1<<k)+1][k]);
}
int main() {
    scanf("%s", s1+1); m = strlen(s1+1);
    n = 0;
    for(int i = 1; i <= m; i ++) s[++ n] = s1[i];
    s[++ n] = 'z'+1;
    for(int i = m; i >= 1; i --) s[++ n] = s1[i];
    get_sa();
    for(int j = 1; j <= 12; j ++)
        for(int i = 1; i+(1<<j)-1 <= n; i ++) h[i][j] = min(h[i][j-1], h[i+(1<<j-1)][j-1]);
    int mx = 0, st;//mx存最大长度，st存起始位置
    for(int i = 1; i <= m; i ++) {//枚举中心点
        //分奇偶讨论
        int tmp = qry(i+1, n-(i-1)+1);//奇数
        if(tmp*2+1 > mx) mx = tmp*2+1, st = i-tmp;
        else if(tmp*2+1 == mx && i-tmp < st) st = i-tmp;
        tmp = qry(i, n-(i-1)+1);//偶数
        if(tmp*2 > mx) mx = tmp*2, st = i-tmp;
        else if(tmp*2 == mx && i-tmp < st) st = i-tmp;
    }
    for(int i = st; i <= st+mx-1; i ++) putchar(s[i]);
    return 0;
}