晓风残月xj

Best Reward Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 417    Accepted Submission(s): 169 Problem Description After an uphill batt

Period Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 2049    Accepted Submission(s): 1010 Problem Description For each prefix of a gi

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

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

Count the string Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 3245    Accepted Submission(s): 1513 Problem Description It is well kn

Seek the Name, Seek the Fame Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 10065   Accepted: 4835 Description The little cat is so famous, that many couples

Oulipo Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 17587   Accepted: 7059 Description The French author Georges Perec (1936–1982) once wrote a book, La d

Corporate Identity Time Limit: 9000/3000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Others) Total Submission(s): 186    Accepted Submission(s): 89 Problem Description Beside other s

Cyclic Nacklace Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1875    Accepted Submission(s): 825 Problem Description CC always becom

Simpsons’ Hidden Talents Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1781    Accepted Submission(s): 649 Problem Description Homer:

Blue Jeans Time Limit: 1000MS   Memory Limit: 65536K Total Submissions: 10119   Accepted: 4280 Description The Genographic Project is a research partnership between IBM and

String Problem Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 1296    Accepted Submission(s): 585 Problem Description Give you a strin

何为回文串？        众所周知，回文串就是左右对称的字符串。  给定一个字符串，要求其中的最长回文子串。这是一个比较简单基本的问题。 1.暴力枚举。枚举以每个字符为中心，看左右延伸的最长回文串，这里注意分奇偶，总的时间复杂度为O(N^N) .这是最简单最基本的算法，通常是不可取的。 2.后缀数组。将原字符串翻过来接在新字符串的后面，中间用某一个特殊的字符串隔开，这样问题就变成了求新字