LightOJ 1258 Making Huge Palindromes 【Manacher算法】
来源:互联网 发布:日本软件行业 编辑:程序博客网 时间:2024/05/16 09:59
题目链接:传送
Submit Status uDebug
Description
A string is said to be a palindrome if it remains same when read backwards. So, 'abba', 'madam' both are palindromes, but 'adam' is not.
Now you are given a non-empty string S, containing only lowercase English letters. The given string may or may not be palindrome. Your task is to make it a palindrome. But you are only allowed to add characters at the right side of the string. And of course you can add any character you want, but the resulting string has to be a palindrome, and the length of the palindrome should be as small as possible.
For example, the string is 'bababa'. You can make many palindromes including
bababababab
babababab
bababab
Since we want a palindrome with minimum length, the solution is 'bababab' cause its length is minimum.
Input
Input starts with an integer T (≤ 10), denoting the number of test cases.
Each case starts with a line containing a string S. You can assume that 1 ≤ length(S) ≤ 106.
Output
For each case, print the case number and the length of the shortest palindrome you can make with S.
Sample Input
4
bababababa
pqrs
madamimadam
anncbaaababaaa
Sample Output
Case 1: 11
Case 2: 7
Case 3: 11
Case 4: 19
Hint
Dataset is huge, use faster I/O methods.
JANE ALAM JAN
LightOJ, Jane Alam Jan
Source
在字符串的右边加入元素使之成为回文串---问所能形成回文串的最短长度-.-
设字符串S----反串为T
我们如果直接将T加入到S的后面一定是回文串-.-
让长度尽可能的少-.-就是让T和S重叠的最多-.-
重叠部分一定是回文串且一定在S的最后面结束----.-
问题就转换为最大的以S末尾结束的回文串的长度-.-
代码“:
#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char ch[1000100];char T[2000200];int P[2000200];int main(){int t;scanf("%d",&t);for (int ca=1;ca<=t;ca++){scanf("%s",ch);int ll=strlen(ch);memset(T,0,sizeof(T));memset(P,0,sizeof(P));for (int i=0;i<=ll;i++){T[2*i+1]='#';T[2*i+2]=ch[i];}T[0]=-1;ll=2*ll;int mid=0,ss=0,ans=0;for (int i=1;i<=ll;i++){if (ss>i)P[i]=min(ss-i,P[2*mid-i]);elseP[i]=1;while (T[i-P[i]]==T[i+P[i]])P[i]=P[i]+1;if (i+P[i]>ss){ss=i+P[i];mid=i;}if (ss>ll)//以T[i]为中心的字符串以到T的末尾--{ans=P[i]-1;break;}}printf("Case %d: %d\n",ca,ll-ans);}return 0;}
- LightOJ 1258 Making Huge Palindromes 【Manacher算法】
- LightOJ 1258 Making Huge Palindromes(manacher算法)
- lightoj 1258 - Making Huge Palindromes 【Manacher】
- LightOJ 1258 - Making Huge Palindromes
- light OJ 1258 - Making Huge Palindromes【Manacher】
- LightOJ 1258 Making Huge Palindromes (回文&KMP)
- LIGHTOJ 1258 – MAKING HUGE PALINDROMES 【KMP】
- LightOJ 1258 Making Huge Palindromes (回文&KMP)
- LightOJ 1258 - Making Huge Palindromes【kmp】
- LightOJ 1258 Making Huge Palindromes (回文&KMP)
- LightOJ 1258 - Making Huge Palindromes (KMP)
- Light OJ 1258 - Making Huge Palindromes (KMP 或 Manacher)
- light oj 1258 - Making Huge Palindromes (Manacher 变形)
- Lightoj-1258 Making Huge Palindromes(kmp||回文串)
- light oj 1258 - Making Huge Palindromes(KMP)
- Light OJ 1258 Making Huge Palindromes 末尾添加最少字符变回文串
- LIGHT OJ 1258 - Making Huge Palindromes 【包含最后一位字符的最长回文串()】
- lightoj 1258(manacher)
- 《高质量C++编程指南》摘录2
- 堆排序
- [Java]批量生成二维码
- 关于Hive中的复杂数据类型Array,Map,Structs的一些使用案例
- Linux下查找大文件,大目录的方法
- LightOJ 1258 Making Huge Palindromes 【Manacher算法】
- 如何在docker和宿主机之间复制文件
- tjut 2842
- 归并排序
- NYOJ 214 单调递增子序列(二)
- Java编程思想第4版-第七章
- linux下Memcache安装过程
- 锁类型为lgwr
- Linux Signal 处理