【HDU3068】【最长回文】【Manacher裸题】

最长回文

Time Limit: 4000/2000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others)
Total Submission(s): 11375    Accepted Submission(s): 4102

Problem Description

给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度.
回文就是正反读都是一样的字符串,如aba, abba等

 

Input

输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c...y,z组成的字符串S
两组case之间由空行隔开(该空行不用处理)
字符串长度len <= 110000

 

Output

每一行一个整数x,对应一组case,表示该组case的字符串中所包含的最长回文长度.

 

Sample Input

  
  

   
   aaaa

abab
  
  

 

Sample Output

  
  

   
   4
3
  
  

 

Source

2009 Multi-University Training Contest 16 - Host by NIT

 

Recommend

lcy

 

#include <iostream>
#include <cstring>
#include <cmath>
#include <queue>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <string>
#include <cstdlib>
#include <cstdio>
#include <algorithm>
using namespace std;

int N;
char t[110010];
char s[110010 * 2];
int z[110010 * 2];
int main()
{
    int n;
	while(scanf("%s",&t) != EOF)
	{
		n = strlen(t);
		N = 2 * n + 1;
		
		memset(s,'.',sizeof(s));
		memset(z,0,sizeof(z));
		for(int i=0;i<n;i++)
		{
			s[i * 2+ 1] = t[i];
		}
		
		int L=0;
		int R=0;
		z[0] = 1;
		for(int i=1;i<N;i++)
		{
			z[i] = (i <= R) ? min(z[2*L-i],R-i+1) : 1;
			while(i-z[i] >= 0 && i+z[i]<N && s[i-z[i]] == s[i+z[i]]) z[i]++;
			if(i+z[i]-1>R) L=i, R =i+z[i]-1;
		}
		int maxs = -1;
		for(int i=0;i<N;i++) maxs = max(maxs,z[i]);
		cout << maxs-1 << endl;
	}
    return 0;
}