Palindrome----Manacher
2017-03-15 21:49
127 查看
Palindrome
Description
Andy the smart computer science student was attending an algorithms class when the professor asked the students a simple question, "Can you propose an efficient algorithm to find the length of the largest palindrome in a string?"
A string is said to be a palindrome if it reads the same both forwards and backwards, for example "madam" is a palindrome while "acm" is not.
The students recognized that this is a classical problem but couldn't come up with a solution better than iterating over all substrings and checking whether they are palindrome or not, obviously this algorithm is not efficient at all, after a while Andy raised
his hand and said "Okay, I've a better algorithm" and before he starts to explain his idea he stopped for a moment and then said "Well, I've an even better algorithm!".
If you think you know Andy's final solution then prove it! Given a string of at most 1000000 characters find and print the length of the largest palindrome inside this string.
Input
Your program will be tested on at most 30 test cases, each test case is given as a string of at most 1000000 lowercase characters on a line by itself. The input is terminated by a line that starts with the string "END" (quotes for clarity).
Output
For each test case in the input print the test case number and the length of the largest palindrome.
Sample Input
Sample Output
题目链接:http://poj.org/problem?id=3974
题目的意思是让你求字符串的最长回文串,Manacher算法的模板,详见的上一篇博客。
代码:
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
using namespace std;
int p[2000000];
void Manacher(string s){
memset(p,0,sizeof(p));
int mx=0,id=0;
for(int i=1;i<=(int)s.size();i++){
if(mx>i){
p[i]=(p[2*id-i])<(mx-i)?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;
}
}
int Max=0,ii;
for(int i=1;i<(int)s.size();i++){
if(p[i]>Max){
ii=i;
Max=p[i];
}
}
Max--;
int ans=0;
int start=ii-Max;
int End=ii+Max;
for(int i=start;i<=End;i++){
if(s[i]!='#'){
ans++;
}
}
cout<<ans<<endl;
}
int main(){
string s;
int cnt=0;
while(getline(cin,s)){
if(s=="END")
break;
cnt++;
int len=s.length();
string str;
str+="$#";
for(int i=0;i<len;i++){
str+=s[i];
str+="#";
}
printf("Case %d: ",cnt);
Manacher(str);
}
return 0;
}
Time Limit: 15000MS | Memory Limit: 65536K | |
Total Submissions: 8726 | Accepted: 3302 |
Andy the smart computer science student was attending an algorithms class when the professor asked the students a simple question, "Can you propose an efficient algorithm to find the length of the largest palindrome in a string?"
A string is said to be a palindrome if it reads the same both forwards and backwards, for example "madam" is a palindrome while "acm" is not.
The students recognized that this is a classical problem but couldn't come up with a solution better than iterating over all substrings and checking whether they are palindrome or not, obviously this algorithm is not efficient at all, after a while Andy raised
his hand and said "Okay, I've a better algorithm" and before he starts to explain his idea he stopped for a moment and then said "Well, I've an even better algorithm!".
If you think you know Andy's final solution then prove it! Given a string of at most 1000000 characters find and print the length of the largest palindrome inside this string.
Input
Your program will be tested on at most 30 test cases, each test case is given as a string of at most 1000000 lowercase characters on a line by itself. The input is terminated by a line that starts with the string "END" (quotes for clarity).
Output
For each test case in the input print the test case number and the length of the largest palindrome.
Sample Input
abcbabcbabcba abacacbaaaab END
Sample Output
Case 1: 13 Case 2: 6
题目链接:http://poj.org/problem?id=3974
题目的意思是让你求字符串的最长回文串,Manacher算法的模板,详见的上一篇博客。
代码:
#include <cstdio>
#include <cstring>
#include <string>
#include <iostream>
using namespace std;
int p[2000000];
void Manacher(string s){
memset(p,0,sizeof(p));
int mx=0,id=0;
for(int i=1;i<=(int)s.size();i++){
if(mx>i){
p[i]=(p[2*id-i])<(mx-i)?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;
}
}
int Max=0,ii;
for(int i=1;i<(int)s.size();i++){
if(p[i]>Max){
ii=i;
Max=p[i];
}
}
Max--;
int ans=0;
int start=ii-Max;
int End=ii+Max;
for(int i=start;i<=End;i++){
if(s[i]!='#'){
ans++;
}
}
cout<<ans<<endl;
}
int main(){
string s;
int cnt=0;
while(getline(cin,s)){
if(s=="END")
break;
cnt++;
int len=s.length();
string str;
str+="$#";
for(int i=0;i<len;i++){
str+=s[i];
str+="#";
}
printf("Case %d: ",cnt);
Manacher(str);
}
return 0;
}
相关文章推荐
- ●POJ 3974 Palindrome(Manacher)
- 最长回文子串(Longest Palindrome Substring)--Manacher算法O(n)
- URAL 1297 Palindrome(Manacher)
- 【Manacher算法】poj3974 Palindrome
- URAL1297 Palindrome 题解&代码【附manacher学习记录】
- POJ 3974 Palindrome【manacher】【模板题】【模板】
- POJ 3974 Palindrome(Manacher)
- 【manacher变形】Timus OJ 1354. Palindrome. Again Palindrome 包尾部最长回文串
- Palindrome - POJ 3974 (最长回文子串,Manacher模板)
- Palindrome(Manacher)
- POJ (Manacher) Palindrome
- 【POJ3974】【Palindrome】【Manacher裸题】
- poj3974 Palindrome(manacher)
- 【POJ3974】Palindrome Manacher、模板题 裸题
- URAL 1297 Palindrome 后缀数组 或 Manacher 求最长回文子串
- Palindrome(Manacher求最大回文长度)
- Palindrome---poj3974(最大回文子串manacher)
- poj 3974 Palindrome(manacher)
- [poj3974]Palindrome_Manacher
- POJ3974 Palindrome(Manacher)