kmp匹配模板

首先: >>大佬博客传送门<<

优化后

#include <bits/stdc++.h>
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define ll long long
#define db double
#define oo 0x3f3f3f3f
#define eps 0.00001
#define all(x) x.begin(), x.end()
#define met(a, b) memset(a, b, sizeof(a))
#define bin(x) cerr << #x << " is " << bitset<15>(x) << endl
#define what_is(x) cerr << #x << " is " << x << endl
#define lowbit(x) x &(-x)
using namespace std;
const int mod = 1e9 + 7;
const int maxn = 1e6 + 10;
string mom, son;
int nxt[maxn];
void _init_() {
	
	int j = 0;
	for (int i = 1; i < son.size(); i++) {
		while (j && son[i] != son[j])j = nxt[j];
		nxt[i + 1] = son[i] == son[j] ? ++j : 0;
	}
}
void solve() {
	int j = 0; _init_();
	for (int i = 0; i < mom.size(); i++) {
		while (j && mom[i] != son[j])
			j = nxt[j];
		if (mom[i] == son[j])
			j++;
		if (j == son.size()) {
            cout << i - j + 2 << endl;
			j = nxt[j];
			i--;
		}
	}
}
int main() {
	ios::sync_with_stdio(0);
    cin >> mom >> son;

	solve();

	for (int i = 1; i <= son.size(); i++) {
		printf("%d", nxt[i]);
		printf(i == son.size() ? "\n" : " ");
	}
}

应用实例

#include <bits/stdc++.h>
using namespace std;
#define _rep(i, a, b) for (int i = (a); i <= (b); ++i)
#define _rev(i, a, b) for (int i = (a); i >= (b); --i)
#define _for(i, a, b) for (int i = (a); i < (b); ++i)
#define _rof(i, a, b) for (int i = (a); i > (b); --i)
#define oo 0x3f3f3f3f
#define ll long long
#define db double
#define eps 1e-8
#define bin(x) cout << bitset<10>(x) << endl;
#define what_is(x) cerr << #x << " is " << x << "s" << endl;
#define met(a, b) memset(a, b, sizeof(a))
#define all(x) x.begin(), x.end()
#define pii pair<int, int>
const int maxn = 1e6 + 10;
int nextt[maxn], n;
string tmp, ans;
void getnxt(string s) {
	int j = 0;
	for (int i = 1; i < s.size(); i++) {
		while (j && s[i] != s[j])j = nextt[j];
		nextt[i + 1] = s[i] == s[j] ? ++j : 0;
	}
}

int nxt()
{
	int ret;
	scanf("%d", &ret);
	return ret;
}
int kmp(string& mom, string& son, int pos) {
	int  j = 0;
	string str = mom.substr(pos, son.size());
	for (int i = 0; i < str.size(); i++) {
		while (j && str[i] != son[j])
			j = nextt[j];
		if (str[i] == son[j])j++;

	}
	return j;
}
vector<string> q;
void add(string fresh) {
	getnxt(fresh);
	int pos = kmp(ans, fresh, max(0, (int)(ans.size() - fresh.size())));
	_for(i, pos, fresh.size()) {
		ans+=fresh[i];
	}
}
int main() {
	n = nxt();
	_rep(i, 1, n) {
		cin >> tmp;
		q.emplace_back(tmp);
	}
	ans = q[0];
	_for(i, 1, n) {
		add(q[i]);
	}
	cout << ans << endl;
}