KMP算法模板（pascal）

洛谷P3375：

 program rrr(input,output);
 var
   i,j,lena,lenb:longint;
   a,b:ansistring;
   next:array[..]of longint;
 begin
    assign(input,'r.in');assign(output,'r.out');reset(input);rewrite(output);
    readln(a);
    readln(b);
    lena:=length(a);lenb:=length(b);
    next[]:=;
    for i:= to lenb do
        begin
           j:=next[i-];
           while (b[i]<>b[j+]) and (j>) do j:=next[j];
           if b[i]=b[j+] then next[i]:=j+ else next[i]:=;
        end;
    j:=;
    for i:= to lena do
        begin
           while (a[i]<>b[j+]) and (j>) do j:=next[j];
           if a[i]=b[j+] then inc(j) else j:=;
           if j=lenb then writeln(i-lenb+);
        end;
    for i:= to lenb do write(next[i],' ');
    close(input);close(output);
 end.