POJ 3974 Palindrome manacher
来源:互联网 发布:t-sql语法基础知识 编辑:程序博客网 时间:2024/04/30 13:26
题目链接:HDU3974
Palindrome
Time Limit: 15000MS Memory Limit: 65536KTotal Submissions: 7002 Accepted: 2596
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.
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
abcbabcbabcbaabacacbaaaabEND
Sample Output
Case 1: 13Case 2: 6
题目分析:相当裸的manacher模板,注意判断结束输入的条件。
//// main.cpp// POJ3974//// Created by teddywang on 16/6/9.// Copyright © 2016年 teddywang. All rights reserved.//#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;char s[2000010];int p[2000010];int main(){ int kase=1; while(scanf("%s",s)) { int len=strlen(s); if(len==3&&strcmp(s,"END")==0) break; for(int i=len;i>=0;i--) { s[2*i+2]=s[i]; s[2*i+1]='#'; } s[0]='*'; int id=0,maxlen=0,maxn=0; for(int i=2;i<2*len+1;i++) { maxlen=id+p[id]-1; if(maxlen>i-1) p[i]=min(p[2*id-i],maxlen-i+1); else p[i]=1; while(s[i+p[i]]==s[i-p[i]]) p[i]++; if(p[i]+i>p[id]+id) id=i; maxn=max(p[i],maxn); } printf("Case %d: %d\n",kase++,maxn-1); }}
0 0
- 【Manacher】 POJ 3974 Palindrome
- POJ 3974 Palindrome Manacher
- POJ 3974 Palindrome【Manacher】
- poj 3974 Palindrome(manacher)
- POJ 3974 - Palindrome(manacher)
- POJ - 3974 Palindrome(manacher)
- POJ 3974 Palindrome manacher
- POJ 3974 Palindrome Manacher
- POJ:3974 Palindrome (Manacher算法)
- 【manacher算法】POJ 3974 Palindrome
- POJ 3974 Palindrome (Manacher算法)
- POJ 3974-Palindrome(Manacher算法)
- POJ 3974 Palindrome(manacher)
- POJ 3974 Palindrome(Manacher)
- POJ 3974 Palindrome(Manacher)
- POJ 3974 Palindrome Manacher算法题解
- POJ - 3974 Palindrome(Manacher算法模板题)
- poj Palindrome 3974 (字符串&manacher)
- 《剑指offer》:[25]二叉树中和为某一值的路径
- linux 6.5下 MySQL 5.6 RPM安装
- 选择排序法
- BIOS/UEFI基础——第一条指令
- Leetcode Paint House
- POJ 3974 Palindrome manacher
- 怎么和自己喜欢的妹子聊天(吼吼吼,我怎么这么笨呢,啊啊啊)
- 《大数据精准挖掘》电信行业应用--客户流失预测
- 关于struts2访问servlet API的三种方法详解
- 折半查找
- 不用+、-、×、÷做加法
- Zephyr 教程:应用程序基础
- 《剑指offer》:[26]复杂链表的复制
- Entity Framework 之Code First自动数据迁移