数据结构：KMP

KMP字符串

题目
题解

#include <iostream>
using namespace std;
const int N = 100010, M = 1000010;
int n, m;
int next_num[N];
char s[M], p[N];
int main()
{
	cin >> n >> p + 1 >> m >> s + 1;
	// 计算 next 数组 
	for(int i = 2, j = 0; i <= n; i ++ ) {
		while (j && p[i] != p[j + 1]) j = next_num[j];
		if (p[i] == p[j + 1]) j ++ ;
		next_num[i] = j;
	}	
	// 计算
	for (int i = 1, j = 0; i <= m; i ++ ) {
		while (j && s[i] != p[j + 1]) j = next_num[j];
		if (s[i] == p[j + 1]) j ++ ;
		if (j == n) {
			cout << i - n << " ";
			j = next_num[j];
		}
	} 
	return 0;
}