A - Palindrome

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

#include <iostream>
#include <cstring>
#include <cstdio>using namespace std;
const int Mod = 1e9 + 7;
const int Maxn = 1000010;
char s[Maxn << 1],tmp[Maxn << 1];
int Len[Maxn << 1];
int Trans(char *st) {int i,len = strlen(st);tmp[0] = '@';for(i=1; i<=len*2; i+=2) {tmp[i] = '#';tmp[i + 1] = st[i >> 1];}tmp[len << 1 | 1] = '#';tmp[(len << 1 | 1) + 1] = '$';tmp[len * 2 + 3] = 0;return len << 1 | 1;
}int Manacher(char * st,int len) {int mx = 0,Ans = 0,id = 0;for(int i=1; i<=len; i++) {if(mx > i)Len[i] = min(mx - i,Len[2 * id - i]);else Len[i] = 1;while(st[i - Len[i]] == st[i + Len[i]]) Len[i]++;if(Len[i] + i > mx) {mx = Len[i] + i;id = i;}Ans = max(Ans,Len[i]);}return Ans - 1;
}int main(int agrc,char* agrv[]) {int kase = 0,Ans;while(scanf("%s",s ) == 1) {if(strcmp(s,"END") == 0) break;int len = Trans(s);Ans = Manacher(tmp,len);printf("Case %d: %d\n",++kase,Ans);}return 0;
}

https://blog.csdn.net/xiaoxiede_wo/article/details/79817998

A - Palindrome相关推荐

【LeetCode】Palindrome Partitioning 解题报告
[题目] Given a string s, partition s such that every substring of the partition is a palindrome. Retur ...
234. Palindrome Linked List - Easy
Given a singly linked list, determine if it is a palindrome. Example 1: Input: 1->2 Output: false ...
LeetCode 125 Valid Palindrome（有效回文）（*）
版权声明:转载请联系本人,感谢配合!本站地址:http://blog.csdn.net/nomasp https://blog.csdn.net/NoMasp/article/details/5062 ...
Lintcode108 Palindrome Partitioning || solution 题解
[题目描述] Given a strings, cutsinto some substrings such that every substring is a palindrome. Return t ...
数位DP 回文序列 POJ-3280 Cheapest Palindrome
Cheapest Palindrome [ POJ - 3280 ] 题目大意: 给定字符串s,长度为m,由n个小写字母组成.在s的任意位置增删字母,把它变成回文串,增删特定字母的花费不同,求最小花费 ...
Determine whether an integer is a palindrome. Do this without extra space.
看到这个题目的时候,首先不认识 Determine这个单词.英文不好没办法,查了下是确认的意思,然后不懂 palindrome这个单词, 查了下是回文的意思. 问题是回文是个什么东西,官方解释: A ...
[leetcode] Palindrome Number
2019独角兽企业重金招聘Python工程师标准>>> Determine whether an integer is a palindrome. Do this without e ...
Uva - 12050 Palindrome Numbers【数论】
题目链接:uva 12050 - Palindrome Numbers 题意:求第n个回文串思路:首先可以知道的是长度为k的回文串个数有9*10^(k-1),那么依次计算,得出n是长度为多少的串,然 ...
【leetcode】132. Palindrome Partitioning II
题目如下: 解题思路:本题是[leetcode]131. Palindrome Partitioning的升级版,要求的是求出最小cuts,如果用[leetcode]131. Palindrome P ...
409 Longest Palindrome
Longest Palindrome 这题我完全想错了. 求最长回文.~~统计个个字母出现次数.奇数的保留最大的那个.偶数全保留.~~这个思路完全错了. 因为奇数中成对的数字也是可以拿来用的. 正确的 ...

A - Palindrome

A - Palindrome相关推荐

最新文章

热门文章