。。。

摘要： PeriodProblem DescriptionFor each prefix of a given string S with N characters (each character has an ASCII code between 97 and 126, inclusive), we wa... 阅读全文

摘要： Seek the Name, Seek the FameDescriptionThe little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat t... 阅读全文

摘要： Simpsons’ Hidden TalentsProblem DescriptionHomer: Marge, I just figured out a way to discover some of the talents we weren’t aware we had.Marge: Yeah,... 阅读全文

摘要： /*主函数里初始化和调用*//*next[0] = 0;exkmp(s2+1,s2,next+1,next);exkmp(s1,s2,ex,next);*//*扩展kmp算法可以用o(n+m)的复杂度求出字符串s1的任意后缀与字符串s2的最长公共前缀*//*扩展kmp算法的next[i]==j表示s... 阅读全文