SPOJ - EPALIN - Extend to Palindrome

题目链接
VJ题目链接

EPALIN - Extend to Palindrome

no tags

Your task is, given an integer N, to make a palindrome (word that reads the same when you reverse it) of length at least N (1 <= N <= 100,000). Any palindrome will do.

Easy, isn’t it? That’s what you thought before you passed it on to your inexperienced team-mate. When the contest is almost over, you find out that that problem still isn’t solved. The problem with the code is that the strings generated are often not palindromic. There’s not enough time to start again from scratch or to debug his messy code.

Seeing that the situation is desperate, you decide to simply write some additional code that takes the output and adds just enough extra characters to it to make it a palindrome and hope for the best. Your solution should take as its input a string and produce the smallest palindrome that can be formed by adding zero or more characters at its end. The input string will consist of only upper and lower case letters.

Example

Input:

aaaa
abba
amanaplanacanal
xyz

Output:

aaaa
abba
amanaplanacanalpanama
xyzyx

Note:

1. All palindromes are considered case-sensitive (i.e. ‘Aa’ is not a palindrome).
2. Large I/O. Be careful in certain languages.

题意:

在子串后补最少的字符，使字符串变成回文串。

题解：

Hash求回文字符串基操，先计算字符串顺序和逆序的哈希值,从1-len枚举 i , 通过顺逆区间的哈希值判断 i (包括 i )后面的子串是否回文串，如果是则在子串后补 i（不包括 i ） 前面的字符。

AC代码：

#include<bits/stdc++.h>
using namespace std;
typedef unsigned long long ull;
const int maxn=100005;
const ull M=1331;
ull power[maxn],Hash1[maxn],Hash2[maxn];
char s[maxn];
void into()
{
	power[0]=1;
	for(int i=1;i<maxn;i++)
	power[i]=power[i-1]*M;
}
int main()
{
	into(); //初始化进制的乘积 不用每次计算 
	while(~scanf("%s",s+1))
	{
		int len=strlen(s+1);
		Hash1[0]=0;         //顺序hash值初始化 
		Hash2[len+1]=0;     //逆序hash值初始化 
		for(int i=1; i<=len; i++)
		{
			Hash1[i]=Hash1[i-1]*M+s[i]-'A';
			Hash2[len+1-i]=Hash2[len+2-i]*M+s[len+1-i]-'A';
		}
		int flag=0;      //判断 i 后面的子串是否有回文串 
		for(int i=1;i<=len;i++)
		{
				int l=i,r=len;
				ull ans=Hash1[r]-Hash1[l-1]*power[r-l+1];
				ull sum=Hash2[l]-Hash2[r+1]*power[r-l+1];
				if(ans==sum)
				{
					flag=1;
					printf("%s",s+1);
					for(int j=i-1;j>=1;j--)
					printf("%c",s[j]);
					printf("\n");
					break;
				}
		}
		if(flag==0){       //如果 i后面的子串没有回文串，构造回文串 
		printf("%s",s+1);
		for(int i=len-1;i>=1;i--)
		printf("%c",s[i]);
		printf("\n");
		}
	}
}