摘要：
P[1]:=0;j:=0;for i:=2 to m dobeginwhile (j>0) and (B[j+1]<>B[i]) do j:=P[j]; if B[j+1]=B[i] then j:=j+1; P[i]:=j;end; j:=0;for i:=1 to n dobegin while 阅读全文
摘要：
img class="desc_img" src="http://image.baidu.com/search/detail?ct=503316480&z=3&ipn=d&word=%E4%BA%8C%E6%AC%A1%E5%85%83&step_word=&hs=0&pn=45&spn=0&di=7919847210&pi=0&rn=1&tn=baiduimagedetail&is=0%2C0&istype=2&ie=utf-8&oe=utf-8&in=&cl=2&lm=-1&st=-1&cs=3398826130%2C2587395830&os=2882414142%2C2382436488&simid=4248945691%2C634611931&adpicid=0&ln=1974&fr=&fmq=1483684459981_R&fm=result&ic=0&s=undefined&se=&sme=&tab=0&width=&height=&face=undefined&ist=&jit=&cg=&bdtype=0&oriquery=&objurl=http:%2F%2Fimg 阅读全文