1.题面
http://acm.hdu.edu.cn/showproblem.php?pid=3068
2.题意
给你一个字符串,让你求最长回文子串,注意,是最长回文字串,不是最长回文子序列
3.思路
方法有很多,有一个我还不会,这是后缀数组版本的
解法如下,比如原来的字符串为
s = "abab"
则构造数组s + '#' + reverse(s)
也就是下面这样
“abab#baba”
然后,枚举回文串的中心,因为回文串的长度有奇数和偶数两种可能,所以我们要分类讨论。
看到题目中那么多输出中间结果,你也知道这道题我做的有多么痛苦了
后缀数组第一题,Never Stop AC!!
4.代码
/*****************************************************************
> File Name: Cpp_Acm.cpp
> Author: Uncle_Sugar
> Mail: uncle_sugar@qq.com
> Created Time: 2016年07月29日 星期五 09时30分02秒
*****************************************************************/
# include <cstdio>
# include <cstring>
# include <cctype>
# include <cmath>
# include <cstdlib>
# include <climits>
# include <iostream>
# include <iomanip>
# include <set>
# include <map>
# include <vector>
# include <stack>
# include <queue>
# include <algorithm>
using namespace std;
template<class T>void PrintArray(T* first,T* last,char delim=' '){
for (;first!=last;first++) cout << *first << (first+1==last?'\n':delim);
}
const int debug = 1;
const int size = 10 + 2*100000 ;
const int INF = INT_MAX>>1;
typedef long long ll;
const int MAXN = 2*100000+10;
int t1[MAXN],t2[MAXN],c[MAXN];
bool cmp(int *r,int a,int b,int l){
return r[a]==r[b]&&r[a+l]==r[b+l];
}
void da(int str[],int sa[],int rank[],int height[],int n,int m){
n++;
int i, j, p, *x = t1, *y = t2;
for (i = 0;i < m;i++) c[i] = 0;
for (i = 0;i < n;i++) c[x[i] = str[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 (j = 1;j <= n; j<<= 1){
p = 0;
for (i = n-j; i < n; i++) y[p++] = i;
for (i = 0; i < n; i++) if (sa[i] >= j) y[p++] = sa[i] - j;
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]] = cmp(y,sa[i-1],sa[i],j)?p-1:p++;
}
if ( p>=n ) break;
m = p;
}
int k = 0;
n--;
for (i = 0; i<= n; i++) rank[sa[i]] = i;
for (i = 0; i< n; i++){
if (k) k--;
j = sa[rank[i]-1];
while (str[i+k] == str[j+k]){
k++;
}
height[rank[i]] = k;
}
}
int rank[MAXN],height[MAXN],str[size];
int sa[MAXN];
int RMQ[MAXN];
char s[size];
int len,n;
struct Comper{
int operator () (const int x,const int y){
return height[x] < height[y]?x:y;
}
}comp;
struct RMQ{
int dp[MAXN][20];
int mm[MAXN];
void initRMQ(int n){
mm[0] = -1;
for(int i = 1; i <= n;i++){
mm[i] = ((i&(i-1)) == 0)?mm[i-1]+1:mm[i-1];
dp[i][0] = i;
}
for(int j = 1; j <= mm[n];j++)
for(int i = 1;i + (1<<j) -1 <= n;i++)
dp[i][j] = comp(dp[i][j-1],dp[i+(1<<(j-1))][j-1]);
}
int rmq(int x,int y){
int k = mm[y-x+1];
return comp(dp[x][k],dp[y-(1<<k)+1][k]);
}
}rmqq;
int ask(int a,int b){
//# cout << "a " << a << ' ' << rank[a] << endl;
//# cout << "b " << b << ' ' << rank[b] << endl;
a = rank[a];b = rank[b];
if (a>b)
swap(a,b);
return rmqq.rmq(a+1,b);
}
int main()
{
std::ios::sync_with_stdio(false);cin.tie(0);
int i,j;
while (cin >> s){
n = len = strlen(s);
for (i=0;i<len;i++) str[i] = s[i];
str[len++] = 1;
for (i=len-2;i>=0;i--) str[len++] = s[i];
str[len] = '\0';
da(str,sa,rank,height,len,128);
//# for (i=1;i<=len;i++){
//# cout << "*" << i << "* ";
//# PrintArray(str+sa[i],str+len);
//# }
rmqq.initRMQ(len);
int ans = 0;
for (i=0;i<n;i++){
int ans1 = height[ask(i,2*n-i)]*2 - 1;
int ans2 = height[ask(i,2*n-i+1)]*2;
//# cout << "i, 2*n-i " << i << " " << 2*n-i << endl;
//# cout << ans1 << endl;
//# cout << "ans2 = "<< ans2 << endl;
//# ans = max(ans,ans2);
ans = max(ans,max(ans1,ans2));
}
//# cout << "ans = ";
cout << ans << endl;
}
return 0;
}