几道KMP题目，经典

pku2406 Power Strings

http://162.105.81.212/JudgeOnline/problem?id=2406

 

pku1961 Period

http://162.105.81.212/JudgeOnline/problem?id=1961

 

pku2752 Seek the Name, Seek the Fame

http://162.105.81.212/JudgeOnline/problem?id=2752

 

pku3461 Oulipo

http://162.105.81.212/JudgeOnline/problem?id=3461

 

pku2185 Milking Grid

http://162.105.81.212/JudgeOnline/problem?id=2185

 

zjut1349 掷硬币

http://acm.zjut.edu.cn/ShowProblem.aspx?ShowID=1349

 

几道非常经典的KMP题目，很巧的利用了kmp中pre数组（前缀数组）的特性。

留题号备忘，附get_pre和匹配模板。

 

get_pre: void get_pre() { j=0; pre[1]=0; for(i=2;i<=l;++i) { while(j>0&&s[i]!=s[j+1]) j=pre[j]; if(s[i]==s[j+1]) ++j; pre[i]=j; } }   

 

 

匹配： void kmp() { j=0; for(i=1;i<=l2;++i) { while(j>0&&S[j+1]!=T[i]) j=pre[j]; if(S[j+1]==T[i]) ++j; if(j==l1) { ans++; j=pre[j]; } } }