摘要:转载请注明出处:http://www.cnblogs.com/fraud/ ——by fraudLong Long MessageTime Limit:4000MSMemory Limit:131072KCase Time Limit:1000MSDescriptionThe little cat ...
阅读全文
摘要:转载请注明出处:http://www.cnblogs.com/fraud/ ——by fraud求最长回文子串。http://acm.timus.ru/problem.aspx?space=1&num=1297Manacher模板题,复杂度O(n),做这题纯属是为了验一下自己写的模板是否正确。当然这...
阅读全文
摘要:转载请注明出处:http://www.cnblogs.com/fraud/ ——by fraudDNA SequenceTime Limit: 1000MSMemory Limit: 65536KDescriptionIt's well known that DNA Sequence is a se...
阅读全文
摘要:转载请注明出处:http://www.cnblogs.com/fraud/ ——by fraudCrazy SearchTime Limit: 1000MSMemory Limit: 65536KDescriptionMany people like to solve hard puzzles so...
阅读全文
摘要:转载请注明出处:http://www.cnblogs.com/fraud/ ——by fraudD. Prefixes and SuffixesYou have a string s = s1s2...s|s|, where |s| is the length of string s, and si...
阅读全文
摘要:转载请注明出处:http://www.cnblogs.com/fraud/ ——by fraudSequenceTime Limit: 5000MSMemory Limit: 65536KCase Time Limit: 2000MSDescriptionGiven a sequence, {A1,...
阅读全文
摘要:原文转自:http://www.cppblog.com/MatoNo1/archive/2011/04/17/144390.aspxKMP:给出两个字符串A(称为模板串)和B(称为子串),长度分别为lenA和lenB,要求在线性时间内,对于每个A[i] (0k,所以又有A[i..p]==B[i-k....
阅读全文