摘要：
#include <stdio.h>#include <string.h>#include <queue>using namespace std;const int MAXN = 250010;const int K = 26;struct Trie{ int wordEnd; int fail; int next[K]; void init(){ wordEnd = 0; fail = -1; memset(next, 0, sizeof(next)); } }tree[MAXN];int cnt;char str[1000010];void prePro 阅读全文
