HDOJ-1711 Number Sequence
摘要：Number SequenceTime Limit: 10000/5000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 6050Accepted Submission(s): 2721Problem DescriptionGiven two sequences of numbers : a[1], a[2], ...... , a[N], and b[1], b[2], ...... , b[M] (1 <= M <= 10000, 1 <= N <= 100
阅读全文
posted @
2012-08-14 11:09
可笑痴狂
阅读(334)
推荐(0) 编辑
HDOJ-1686 Oulipo ------------------KMP
摘要：OulipoTime Limit: 3000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 2620Accepted Submission(s): 1012Problem DescriptionThe French author Georges Perec (1936–1982) once wrote a book, La disparition, without the letter 'e'. He was a member of the Oulipo gr
阅读全文
posted @
2012-08-14 10:08
可笑痴狂
阅读(307)
推荐(0) 编辑
POJ 1961 Period --------KMP
摘要：PeriodTime Limit: 3000MSMemory Limit: 30000KTotal Submissions: 9758Accepted: 4461DescriptionFor 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 is, for each i (2 <= i
阅读全文
posted @
2012-08-14 09:28
可笑痴狂
阅读(1304)
推荐(0) 编辑
POJ-2752 Seek the Name, Seek the Fame -------KMP
摘要：Seek the Name, Seek the FameTime Limit: 2000MSMemory Limit: 65536KTotal Submissions: 8261Accepted: 3883DescriptionThe 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 sam
阅读全文
posted @
2012-08-13 13:28
可笑痴狂
阅读(3563)
推荐(1) 编辑
HDOJ 2087 剪花布条 --------KMP算法
摘要：剪花布条Time Limit: 1000/1000 MS (Java/Others)Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 4655Accepted Submission(s): 3130Problem Description一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一些图案。对于给定的花布条和小饰条，计算一下能从花布条中尽可能剪出几块小饰条来呢？Input输入中含有一些数据，分别是成对出现的花布条和小饰条，其布条都是用可见ASCII字符表示的，可见的ASCII字符有多少个，布条的花纹也有多少
阅读全文
posted @
2012-08-13 11:25
可笑痴狂
阅读(632)
推荐(0) 编辑
POJ -2406 power strings --KMP中next函数的应用
摘要：Power StringsTime Limit: 3000MSMemory Limit: 65536KTotal Submissions: 23370Accepted: 9811DescriptionGiven 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 multiplica
阅读全文
posted @
2012-08-13 10:47
可笑痴狂
阅读(435)
推荐(0) 编辑
