随笔分类 - 数据结构-KMP
摘要:Simpsons’ Hidden TalentsTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionHomer: Marg...
阅读全文
摘要:Cyclic NacklaceTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionCC always becomes ve...
阅读全文
摘要:Count the stringTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Problem DescriptionIt is well known th...
阅读全文
摘要:Milking GridTime Limit: 3000MS Memory Limit: 65536KDescriptionEvery morning when they are milked, the Farmer John’s cows form a rectan...
阅读全文
摘要:PeriodTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Problem DescriptionFor each prefix of a given st...
阅读全文
摘要:PeriodTime Limit: 3000MS Memory Limit: 30000KDescriptionFor each prefix of a given string S with N characters (each character has...
阅读全文
摘要:Power StringsTime Limit: 3000MS Memory Limit: 65536KDescriptionGiven two strings a and b we define a*b to be their concatenation....
阅读全文
摘要:Seek the Name, Seek the FameTime Limit: 2000MS Memory Limit: 65536KDescriptionThe little cat is so famous, that many couples tram...
阅读全文
摘要:原题传送:http://poj.org/problem?id=3461OulipoTime Limit: 1000MS Memory Limit: 65536KDescriptionThe French author Georges Perec (1936–...
阅读全文