模版——KMP

#include <iostream>
#include <cstdio>
#include <cstring>

const int maxn = 10000;
int f[maxn];
char P[maxn];
char T[maxn];
void getfail(char* P, int *f) {
    f[0] = f[1] = 0;
    int n = strlen(P);
    for(int i = 0; i < n; i++) {
        int j = f[i];
        while(j && P[i] != P[j]) j = f[j];
        f[i+1] = P[i] == P[j] ? j+1 : 0;
    }
}

void KMP(char* T, char* P, int* f) {
    int n = strlen(T), m = strlen(P);
    getfail(P, f);
    int j = 0;
    for(int i = 0; i < n; i++) {
        while(j && T[i] != P[j]) j = f[j];
        if(T[i] == P[j]) j++;
        if(j == m) {
            printf("%d
", i-m+1);
            j = 0;
        }
    }
}