随笔分类 -  KMP & 扩展KMP & Manacher

HDU 5340 Three Palindromes（Manacher）
摘要：Problem Description：Can we divided a given string S into three nonempty palindromes?Input：First line contains a single integerT≤20which denotes the nu... 阅读全文
posted @ 2015-11-12 16:25 搁浅の记忆 阅读(224) 评论(0) 推荐(0)
2015ACM/ICPC亚洲区沈阳站-重现赛 1002 Bazinga
摘要：http://acm.hdu.edu.cn/contests/contest_show.php?cid=645Problem Description:Ladies and gentlemen, please sit up straight.Don't tilt your head. I'm seri... 阅读全文
posted @ 2015-10-31 16:41 搁浅の记忆 阅读(198) 评论(0) 推荐(0)
LightOJ 1258 (Manacher 或者KMP都行)
摘要：题目链接：http://acm.hust.edu.cn/vjudge/contest/view.action?cid=96545#problem/DDescription：A string is said to be a palindrome if it remains same when read... 阅读全文
posted @ 2015-10-24 19:34 搁浅の记忆 阅读(294) 评论(0) 推荐(0)
HDU 3613 Best Reward
摘要：Description：After an uphill battle, General Li won a great victory. Now the head of state decide to reward him with honor and treasures for his great ... 阅读全文
posted @ 2015-10-12 11:36 搁浅の记忆 阅读(224) 评论(0) 推荐(0)
HDU 3068 最长回文（Manacher算法模板）
摘要：Description：给出一个只由小写英文字符a,b,c...y,z组成的字符串S,求S中最长回文串的长度.回文就是正反读都是一样的字符串,如aba, abba等Input：输入有多组case,不超过120组,每组输入为一行小写英文字符a,b,c...y,z组成的字符串S两组case之间由空行隔开... 阅读全文
posted @ 2015-10-12 09:49 搁浅の记忆 阅读(167) 评论(0) 推荐(0)
HDU 3374 String Problem（最大最小表示）
摘要：Description:Give you a string with length N, you can generate N strings by left shifts. For example let consider the string “SKYLONG”, we can generate... 阅读全文
posted @ 2015-10-09 17:26 搁浅の记忆 阅读(189) 评论(0) 推荐(0)
HDU 4300 Clairewd’s message
摘要：Description：Clairewd is a member of FBI. After several years concealing in BUPT, she intercepted some important messages and she was preparing for sen... 阅读全文
posted @ 2015-10-09 14:07 搁浅の记忆 阅读(134) 评论(0) 推荐(0)
HDU 3746 Cyclic Nacklace
摘要：Description：CC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only ... 阅读全文
posted @ 2015-10-08 23:28 搁浅の记忆 阅读(131) 评论(0) 推荐(0)
HDU 1711 Number Sequence(KMP模板)
摘要：Problem Description:Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 const int N=1000010;int a[N], b[10010... 阅读全文
posted @ 2015-09-01 13:00 搁浅の记忆 阅读(140) 评论(0) 推荐(0)