![](https://img-blog.csdnimg.cn/20201014180756925.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
字符串
文章平均质量分 86
fanesemyk
这个作者很懒,什么都没留下…
展开
-
hdu 1867 Cow Patterns kmp模板
Description A particular subgroup of K (1 <= K <= 25,000) of Farmer John's cows likes to make trouble. When placed in a line, these troublemakers stand together in a particular order. In order to l原创 2016-11-09 21:56:24 · 401 阅读 · 0 评论 -
哈希 poj2752 Seek the Name, Seek the Fame
Time Limit: 2000MS Memory Limit: 65536K Total Submissions: 17568 Accepted: 9009 Description The little cat is so famous, that many couples tramp over hill and dale to Byteland,原创 2016-10-28 23:54:51 · 359 阅读 · 0 评论 -
模板 kmp算法 hdu 1711 Number Sequence
Description Given two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 1000000). Your task is to find a number K which make a[K] = b[1], a原创 2016-11-02 21:00:34 · 263 阅读 · 0 评论 -
Uva 213 Message Decoding
紫书第四章例题 我用的基本上是紫书的方法:首先我们可以推出解码序列和位数、其二进制形式数值的联系(找规律),就是x=(1weishu)-weishu-1+j; 然后写一个readnum函数,用来读入数据。 为什么要写一个函数来读入数据呢?因为这道题,可能读2位的数据,也有可能读3位的数据。。。。写一个函数,可以方便的利用getchar,使得程序结构简化。 最后这道题的坑点在原创 2016-11-23 09:28:40 · 280 阅读 · 0 评论 -
hdu 3336 Count the string 用心写的题解
Problem Description It is well known that AekdyCoin is good at string problems as well as number theory problems. When given a string s, we can write down all the non-empty prefixes of this string. Fo原创 2016-11-08 19:51:31 · 530 阅读 · 0 评论