KMP算法

#include<iostream> #include<cstdio> #include<cstring> using namespace std; const int maxn = 1070000; int S[maxn]; int P[maxn]; int Next[maxn]; inline void BuildNext(int lenp) { int k = -1; Ne

>>阅读原文<<