小磊's blog

Count the string                           Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)                            Total Submission(s): 3092 Accepted Submission(s

忘了做的哪里的题了。。。。。。。。。。。。。。。。。。。。。 code: #include #include using namespace std; int next[100000]; char s[100000],t[10000]; void get_next() { int i=0; int j=-1; int len=strlen(t); next[0]=-1; while(

剪花布条 Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 6230 Accepted Submission(s): 4139 Problem Description 一块花布条，里面有些图案，另有一块直接可用的小饰条，里面也有一

Power Strings Time Limit: 3000MS   Memory Limit: 65536K Total Submissions: 27099   Accepted: 11345 Description Given two strings a and b we define a*b to be their concatena

Number Sequence Time Limit: 10000/5000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 8122 Accepted Submission(s): 3686 Problem Description Given two sequences

A + B for you again                   Time Limit: 5000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)                   Total Submission(s): 3073 Accepted Submission(s): 758 Pr

Cyclic Nacklace                                      Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)                                      Total Submission(s): 1839 A

The Minimum Length Time Limit: 1 Sec Memory Limit: 128 MB Submissions: 405 Solved: 131 Description There is a string A. The length of A is less than 1,000,000. I rewrite it again and again. Then

一个重要的性质len-next[i]为此字符串的最小循环节(i为字符串的结尾)，另外如果len%(len-next[i])==0,此字符串的最小周期就为len/(len-next[i]);        next数组的解释：next[i]代表了前缀和后缀的最大匹配的值（需要彻底明白这点，相当重要）     http://blog.youkuaiyun.com/niushuai666

Oulipo                  Time Limit: 3000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)                  Total Submission(s): 3459 Accepted Submission(s): 1351 Problem Descript

Find the Shortest Common Superstring    Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 65535/65535 K (Java/Others)    Total Submission(s): 1120 Accepted Submission(s): 286 Problem Descrip

Simpsons’ Hidden Talents                     Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)                     Total Submission(s): 1699 Accepted Submission(s): 61

确定比赛名次                         Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)                                  Total Submission(s): 6509 Accepted Submission(s): 247