P3375 【模板】KMP字符串匹配

【模板】KMP字符串匹配 - 洛谷https://www.luogu.com.cn/problem/P3375

#include <iostream>
#include <cstdio>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <stack>
#include <cstring>
#include <set>
#include <unordered_map>
#include <cmath>
#include <map>
#include <cctype>
#include <cstdlib>
#include <deque>
typedef long long ll;
typedef unsigned long long ull;
using namespace std;
const int MN = 65005;
const int MAXN = 1e6 + 5;
const int INF = 0x3f3f3f3f;
#define IOS ios::sync_with_stdio(false)
#define lowbit(x) ((x)&(-x))


//KMP
int pmt[MAXN];
string s, p;

inline void init(const string &s) {
	for (int i = 1, j = 0; i < s.length(); i++) {
		while (j && s[i] != s[j])
			j = pmt[j - 1];
		if (s[i] == s[j])
			j++;
		pmt[i] = j;
	}
}

inline void kmp(const string &s, const string &p) {
	for (int i = 0, j = 0; i < s.length(); i++) {
		while (j && s[i] != p[j])
			j = pmt[j - 1];
		if (s[i] == p[j])
			j++;
		if (j == p.length()) {
			printf("%d\n", i - j + 2);
			j = pmt[j - 1];
		}
	}
}

int main() {
	cin >> s >> p;
	init(p);
	kmp(s, p);
	for (int i = 0; i < p.length(); i++) {
		printf("%d ", pmt[i]);
	}
	return 0;
}