POJ3974 Palindrome (manacher算法)
题意:非常简单,求一个串的最长回文子串。
解题思路:本来用后缀数组也能解,但是串的长度为10^6,后缀数组就做不了了。因此,学习了下manacher算法。。
这里有个链接推荐下:
O(n)回文子串(Manacher)算法
代码:
#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std ;
const int maxn = 2111111 ;
int p[maxn] ;
void solve ( char *s , int len ) {
int i , j , k ;
int mx = 0 , id = 0 ;
memset ( p , 0 , sizeof ( int ) * len ) ;
p[0] = 1 ;
int ans = 0 ;
for ( i = 1 ; i < len ; i ++ ) {
if ( mx > i ) p[i] = min ( p[2*id-i] , mx - i ) ;
else p[i] = 1 ;
while ( s[i-p[i]] == s[i+p[i]] ) p[i] ++ ;
if ( i + p[i] > mx ) {
mx = i + p[i] ;
id = i ;
}
ans = max ( ans , p[i] - 1 ) ;
}
printf ( "%d\n" , ans ) ;
}
char s[maxn] ;
char s1[maxn] ;
int main () {
int ca = 0 ;
while ( scanf ( "%s" , s ) != EOF ) {
if ( s[0] == 'E' ) break ;
int i , j , k , len = strlen ( s ) ;
int n = 2 ;
s1[0] = '$' , s1[1] = '#' ;
for ( i = 0 ; i < len ; i ++ ) {
s1[n++] = s[i] ;
s1[n++] = '#' ;
}
s1[n] = 0 ;
printf ( "Case %d: " , ++ ca ) ;
solve ( s1 , n ) ;
}
return 0 ;
}