
manacher
Lyang0.0
这个作者很懒,什么都没留下…
展开
专栏收录文章
- 默认排序
- 最新发布
- 最早发布
- 最多阅读
- 最少阅读
-
G - Palindrome(Manacher1)
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 lar...原创 2019-08-03 16:15:24 · 156 阅读 · 0 评论 -
H - 吉哥系列故事——完美队形II(Manacher2)
吉哥又想出了一个新的完美队形游戏! 假设有n个人按顺序站在他的面前,他们的身高分别是h[1], h[2] ... h[n],吉哥希望从中挑出一些人,让这些人形成一个新的队形,新的队形若满足以下三点要求,则就是新的完美队形: 1、挑出的人保持原队形的相对顺序不变,且必须都是在原队形中连续的; 2、左右对称,假设有m个人形成新的队形,则第1个人和第m个人身高相同,第2个人和第m-...原创 2019-08-03 16:43:17 · 184 阅读 · 0 评论 -
I - Girls' research(Manacher3)
One day, sailormoon girls are so delighted that they intend to research about palindromic strings. Operation contains two steps: First step: girls will write a long string (only contains lower case) ...原创 2019-08-03 17:13:13 · 173 阅读 · 0 评论 -
J - Making Huge Palindromes(Manacher4)
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 stringS, containing only lowerc...原创 2019-08-05 08:07:51 · 211 阅读 · 0 评论