ACM KMP
青山绿水之辈
奋斗青春年华
展开
-
hdu1358
Problem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we want to know whether the prefix is a periodic string. Th原创 2013-07-26 13:04:35 · 1217 阅读 · 0 评论 -
hdu1686
题目意思:找到上串在下串中有多少个Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo group. A quote from the b原创 2013-07-26 13:15:09 · 1231 阅读 · 0 评论 -
hdu1711
Number SequenceTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 8078 Accepted Submission(s): 3670Problem DescriptionGiven two sequences原创 2013-07-26 13:25:33 · 1220 阅读 · 0 评论 -
Power Strings
Total Submission(s) : 10 Accepted Submission(s) : 4Problem DescriptionGiven two strings a and b we define a*b to be their concatenation. For example, if a = "abc" and b = "def" then a*b = "abcdef"原创 2013-07-26 13:09:42 · 1057 阅读 · 0 评论 -
亲和串
Problem Description人随着岁数的增长是越大越聪明还是越大越笨,这是一个值得全世界科学家思考的问题,同样的问题Eddy也一直在思考,因为他在很小的时候就知道亲和串如何判断了,但是发现,现在长大了却不知道怎么去判断亲和串了,于是他只好又再一次来请教聪明且乐于助人的你来解决这个问题。亲和串的定义是这样的:给定两个字符串s1和s2,如果能通过s1 # 循环 # 移位原创 2013-07-26 13:19:49 · 944 阅读 · 0 评论 -
Girls' research 最长回文串
Problem DescriptionOne 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原创 2013-07-27 00:01:48 · 873 阅读 · 0 评论 -
hdu4552(串的匹配 真是经典)
Problem Description “在树最美丽的那天,当时间老人再次把大钟平均分开时,我会降临在灯火之城的金字塔前,带走那最珍贵的笑容。”这是怪盗基德盗取巴黎卢浮宫的《蒙娜丽莎的微笑》这幅画时,挑战书上的内容。 但这次,怪盗基德的挑战书上出现了一串串小写字母“aaab sdfeeddd...”。柯南以小学生的眼睛,超凡高中生的头脑,快速统计各种字母频率,字符串长度,并结合挑战书原创 2013-05-22 23:10:57 · 1073 阅读 · 0 评论 -
hdu3746(Cyclic Nacklace)
Problem DescriptionCC always becomes very depressed at the end of this month, he has checked his credit card yesterday, without any surprise, there are only 99.9 yuan left. he is too distressed and原创 2013-07-26 23:58:08 · 807 阅读 · 0 评论 -
CSU 1620: A Cure for the Common Code(KMP+区间DP)
DescriptionInputOutputSample Inputabcbcbcbcaabbbcdcdcdabbbcdcdcd0Sample OutputCase 1: 7Case 2: 11HINT题意:给一个小写子母的串,相邻相同的子串可以合在一起,问这个串合并后原创 2015-05-17 19:39:17 · 1131 阅读 · 0 评论