字符串_KMP
SCUT_Pein
这个作者很懒,什么都没留下…
展开
-
POJ3461 KMP算法
Description The 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 book: Tout avait Pair n原创 2013-01-31 22:00:39 · 567 阅读 · 0 评论 -
POJ2406 KMP算法
Description Given 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". If we think of concatenation as multiplication, exponentiat原创 2013-01-31 21:57:10 · 787 阅读 · 0 评论 -
HDU1358--Period
Description For 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. That i原创 2013-02-04 15:13:30 · 513 阅读 · 0 评论 -
Codeforces Round #170 (Div. 2)Tire--KMP
Coming up with a new problem isn't as easy as many people think. Sometimes it is hard enough to name it. We'll consider a title original if it doesn't occur as a substring in any titles of recent Cod原创 2013-03-01 15:44:22 · 514 阅读 · 0 评论 -
EKMP模板
#include #include #include using namespace std; #define maxn 100080 int Next[maxn],Extend[maxn];//Extend[i]表示原串以第i开始与模式串的前缀的最长匹配 char str1[maxn],str2[maxn]; void EKMP(char * s,char * t)//s为主串,t为模板串原创 2014-05-23 10:18:38 · 859 阅读 · 0 评论