KMP模板

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;

void GetNext(string& input, vector<int>& nx) {
	int i = 0, j = -1, len = input.size();
	nx.assign(len + 1, -1);
	while (i < len) {
		if (j == -1 || input[i] == input[j]) {
			nx[++i] = ++j;
		}
		else j = nx[j];
	}
}
int IsOk(string& a, string& b, vector<int>& nx) {
	int i = 0, j = 0, alen = a.size(), blen = b.size();
	while (i < alen && j < blen) {
		if (j == -1 || a[i] == b[j])i++, j++;
		else j = nx[j];
	}
	if (j == blen) return i - j;
	return -1;
}