POJ 3974 Palindrome (manachr模板题)
2016-12-05 17:15
302 查看
题意:
求最长回文串的长度
代码:
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
求最长回文串的长度
代码:
#include <iostream> #include <cstdio> #include <cstring> using namespace std; const int MAXN=1000010; struct Manacher{ char Ma[MAXN*2]; int Mp[MAXN*2]; int Mx[MAXN*2]; int len; double ave; int l; int ans; void manachar(char s[]){ l=0;ans=0; len=strlen(s); Ma[l++]='$'; Ma[l++]='#'; for(int i=0; i<len; i++) { Ma[l++]=s[i]; Ma[l++]='#'; } Ma[l]=0; int mx=0,id=0; for(int i=0; i<l; i++) { ave++; Mp[i]=mx>i?min(Mp[2*id-i],mx-i):1; while(Ma[i+Mp[i]]==Ma[i-Mp[i]]){ Mp[i]++; ave++; } if(i+Mp[i]>mx) { mx=i+Mp[i]; id=i; } Mx[i]=mx; ans=max(ans,Mp[i]-1); } ave/=len; } void debug(){ printf("id: "); for(int i=0;i<l;i++) printf("%4d",i); printf("\n"); printf("char: "); for(int i=0;i<l;i++) printf("%c ",Ma[i]); printf("\n"); printf("Mx: "); for(int i=0;i<l;i++) printf("%4d",Mx[i]); printf("\n"); printf("Mp: "); for(int i=0;i<l;i++) printf("%4d",Mp[i]); printf("\n"); printf("ave: %lf",ave); printf("\n"); } }; Manacher man; char buf[MAXN]; int main(){ int T=0; while(scanf("%s",&buf)){ if(strcmp(buf,"END")==0) break; man.manachar(buf); printf("Case %d: %d\n",++T,man.ans); } }
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
相关文章推荐
- Palindrome - POJ 3974 (最长回文子串,Manacher模板)
- POJ 3974 Palindrome【manacher】【模板题】【模板】
- POJ 3974 Palindrome【最长回文串(Manacher模板)】
- POJ 3974 Palindrome Manacher
- POJ3974——Palindrome
- POJ----(3974 )Palindrome [最长回文串]
- POJ 3974 Palindrome(最长回文子串)
- poj 3974 Palindrome(最长回文子串,处理大数,Manacher算法)
- poj 3974 Palindrome(manacher)
- POJ 3974 Palindrome
- POJ - 3974 Palindrome
- poj_3974 Palindrome(最长回文子串)
- 【Manacher】 POJ 3974 Palindrome
- POJ 3974 - Palindrome(manacher)
- poj 3974 Palindrome
- POJ 3974 Palindrome
- POJ - 3974 Palindrome
- poj 3974 Palindrome 【最长连续回文子串,Manacher算法】
- 【manacher算法】POJ 3974 Palindrome
- POJ 3974 Manacher算法(模板)