求一个字符串的最长回文子串,很明显,把这个串倒过来加到原来的串后面,后缀数组即可,注意中间用1隔开,最后补0,。要注意sa[i-1]和sa[i]要在两个串中且对应位置正好满足关系 : sa[i-1]+sa[i]+height[i])== 2*n+1。这个就很明显了
#include<iostream>
#include<stdio.h>
#include<string.h>
#define rep(i,n) for(int i = 0;i < n; i++)
using namespace std;
const int size = 200005,INF = 1<<30;
char s[size];
int rk[size],sa[size],height[size],w[size],wa[size],res[size];
void getSa (int len,int up) {
int *k = rk,*id = height,*r = res, *cnt = wa;
rep(i,up) cnt[i] = 0;
rep(i,len) cnt[k[i] = w[i]]++;
rep(i,up) cnt[i+1] += cnt[i];
for(int i = len - 1; i >= 0; i--) {
sa[--cnt[k[i]]] = i;
}
//初始化
int d = 1,p = 0;
while(p < len){
for(int i = len - d; i < len; i++) id[p++] = i;
rep(i,len) if(sa[i] >= d) id[p++] = sa[i] - d;//id保存了按后h/2排序的的序列,即排第i的后h/2的是原数组中的哪一个,往前d个找开头
rep(i,len) r[i] = k[id[i]]; //重新构造串!
rep(i,up) cnt[i] = 0;
rep(i,len) cnt[r[i]]++;
rep(i,up) cnt[i+1] += cnt[i];
for(int i = len - 1; i >= 0; i--) {
sa[--cnt[r[i]]] = id[i];
}
//同上
swap(k,r);
p = 0;
k[sa[0]] = p++; //更新字符上限
rep(i,len-1) {
if(sa[i]+d < len && sa[i+1]+d <len &&r[sa[i]] == r[sa[i+1]]&& r[sa[i]+d] == r[sa[i+1]+d])
k[sa[i+1]] = p - 1;
else k[sa[i+1]] = p++;
}
//懂了!
if(p >= len) return ; //超出len,直接结束
d *= 2,up = p, p = 0;
}
}
void getHeight(int len) {
rep(i,len) rk[sa[i]] = i;
height[0] = 0;
for(int i = 0,p = 0; i < len - 1; i++) {
int j = sa[rk[i]-1];
while(i+p < len&& j+p < len&& w[i+p] == w[j+p]) {
p++;
}
height[rk[i]] = p;
p = max(0,p - 1);
}
}
int main()
{
int n,up=0;
gets(s);
n=strlen(s);
for(int i=0;i<n;i++)
{
w[i]=s[i];
up=max(up,w[i]);
}
w[n]=1;
for(int i=n+1;i<=2*n;i++)
w[i]=s[2*n-i];
w[2*n+1]=0;
getSa(2*n+1,up+1);
getHeight(2*n+1);
int ans=1,j=0;
for(int i=1;i<=2*n;i++)
{
if(((sa[i]<n&&sa[i-1]>n)||(sa[i]>n&&sa[i-1]<n))&&( (sa[i-1]+sa[i]+height[i])== 2*n+1 ))
{
if(ans<height[i])
{
ans=height[i];
j=sa[i-1]<sa[i]?sa[i-1]:sa[i];
}
else if(ans==height[i])
{
j=min(j,min(sa[i-1],sa[i]));
}
}
}
// if(j>n)
//printf("%d\n",ans);
for(int i=j;i<j+ans;i++)
printf("%c",s[i]);
printf("\n");
return 0;
}