KMP
13vickey
从不思考到底离梦的距离有多远,走一步注定会近一步,一步一步,用旅途的努力来收获成长。
展开
-
Seek the Name, Seek the Fame KMP
Description The little cat is so famous, that many couples tramp over hill and dale to Byteland, and asked the little cat to give names to their newly-born babies. They seek the name, and at the sa原创 2014-03-12 19:23:30 · 441 阅读 · 0 评论 -
Milking Grid 简单KMP
Description Every morning when they are milked, the Farmer John's cows form a rectangular grid that is R (1 <= R <= 10,000) rows by C (1 <= C <= 75) columns. As we all know, Farmer John is quite th原创 2014-03-12 20:49:23 · 661 阅读 · 0 评论 -
Simpsons’ Hidden Talents
题意: 给俩个字符串,要找第一个串的前缀等于第二个串的后缀。为这个前缀最长可以是多少 不可以直接s1+s2 然后预处理…… 特殊的例子 aabaa baaba #include #include #include #include #include #include using namespace std; string s1,s2; int pre[50010]; int m原创 2014-03-13 11:59:47 · 881 阅读 · 0 评论 -
Oulipo KMP
题意:T组数据 第一行是单词,第二行文本,问单词在文本中出现多少次 Input The first line of the input file contains a single number: the number of test cases to follow. Each test case has the following format: One原创 2014-03-15 22:39:37 · 648 阅读 · 0 评论 -
poj 3080 字符串
题目原述 处理di'yi原创 2014-07-19 17:00:38 · 465 阅读 · 0 评论 -
hdu 5164 Matching on Array AC自动机
Matching on Array Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 257 Accepted Submission(s): 61 Problem Description Alice has a seq原创 2015-01-27 19:32:05 · 634 阅读 · 0 评论