KMP模板

for i:=2 to m do
begin
while (j>0)and(s[i]<>s[j+1]) do j:=next[j];
if s[i]=s[j+1] then inc(j);
next[i]:=j;
end;

function kmp(s1,s2:ansistring):longint;
var
i,j,k,n,ans:longint;
begin
j:=0;n:=length(s1);ans:=0;
for i:=1 to n do
begin
while (j>0)and(s1[i]<>s2[j+1]) do begin j:=next[j];end;
if s1[i]=s2[j+1] then inc(j);
if j=m then
begin
inc(ans);
j:=next[j];
end;
end;
exit(ans);
end;