随笔分类 -  KMP

HUST 1010 The Minimum Length （KMP 最短循环节）
摘要：DescriptionThere is a string A. The length of A is less than 1,000,000. I rewrite it again and again. Then I got a new string: AAAAAA...... Now I cut ... 阅读全文

posted @ 2015-07-22 11:32 甜蜜蜜吖甜蜜蜜 阅读(191) 评论(1) 推荐(0)

POJ-1961-Period
摘要：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 whe... 阅读全文

posted @ 2015-07-22 09:03 甜蜜蜜吖甜蜜蜜 阅读(175) 评论(0) 推荐(0)

KMP（1-模板题）
摘要：DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 #include #include using namespace std;const in... 阅读全文

posted @ 2015-07-21 11:12 甜蜜蜜吖甜蜜蜜 阅读(215) 评论(0) 推荐(0)

导航