手搓kmp朴素版{代码}

#include <iostream>
#include <string>

using namespace std;

const int N = 1e5 + 10, M = 1e4 + 10;

int m, n;
string p, t;

int next1[M];//前缀数组

int main()
{
	cin >> m >> p >> n >> t;

	p = ' ' + p;
	t = ' ' + t;

	for (int i = 2, j = 0; i <= m; ++ i) {
		while (j && p[i] != p[j+1]) j = next1[j];
		if(p[i] == p[j+1]) ++ j;
		next1[i] = j;
	}

	for(int i = 1, j = 0; i <= n; ++ i)	{
		while (j && t[i] != p[j+1]) j = next1[j];
		if(t[i] == p[j+1]) ++ j;
		if(j == m) {
			j = next1[j];
			cout << i - m << "";
		}
	}
	return 0;
}