yishenpingan的专栏

Count the string Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 5   Accepted Submission(s) : 2 Problem Description It is well known

Spell checker Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 19066   Accepted: 6970 Description You, as a member of a development team for a new spell check

Excuses, Excuses! Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 3658   Accepted: 1272 Description Judge Ito is having a problem with people subpoenaed for

Expression Evaluator Time Limit: 2000MS   Memory Limit: 65536K Total Submissions: 1925   Accepted: 594 Description This problem is about evaluating some C-style expressio

Integer Inquiry Time Limit: 1000MS   Memory Limit: 10000K Total Submissions: 29577   Accepted: 11509 Description One of the first users of BIT's new supercomputer was Chi

#include #include #include #include using namespace std; typedef struct { char s[100]; char re_s[100]; }word; word data[30005]; int cnt = 0; typedef struct { int num; int start; }p

统计难题 Time Limit : 4000/2000ms (Java/Other)   Memory Limit : 131070/65535K (Java/Other) Total Submission(s) : 3   Accepted Submission(s) : 2 Problem Description Ignatius最近遇到一个难题,老师交给他很多单词(只

Hat’s Words Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 65536/32768K (Java/Other) Total Submission(s) : 6   Accepted Submission(s) : 2 Problem Description A hat’s word is a word

亲和串 Time Limit : 3000/1000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 14   Accepted Submission(s) : 3 Problem Description 人随着岁数的增长是越大越聪明还是越大越笨，这是一个值得全世

Number Sequence Time Limit : 10000/5000ms (Java/Other)   Memory Limit : 32768/32768K (Java/Other) Total Submission(s) : 5   Accepted Submission(s) : 4 Problem Description Given two sequenc

Oulipo Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 11   Accepted Submission(s) : 4 Problem Description The French author Georg

TEX Quotes Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 20000/10000K (Java/Other) Total Submission(s) : 3   Accepted Submission(s) : 3 Problem Description TEX is a typesetting la

Phone List Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 12   Accepted Submission(s) : 3 Problem Description Given a list of p

Message Decowding Time Limit : 2000/1000ms (Java/Other)   Memory Limit : 131072/65536K (Java/Other) Total Submission(s) : 4   Accepted Submission(s) : 4 Problem Description The cows are th

Period Time Limit : 6000/3000ms (Java/Other)   Memory Limit : 60000/30000K (Java/Other) Total Submission(s) : 16   Accepted Submission(s) : 3 Problem Description For each prefix of a given

KMP 算法 与 朴素算法相比少了不必要的重复工作，比如ABABCD串在C处失配应从第二个A处匹配，不是第一个A处匹配。所以KMP的关键是状态转移表（预处理时间是0（M）），总的时间复杂度是0（M + N）。 状态转移就是模式串每个位置的最大相等子串。 前提： #include #include #include using namespace std; char w[10010];