yp_2013的博客

#include <set>#include <map>#include <queue>#include <stack>#include <math.h>#include <stdio.h>#include <stdlib.h>#include <iostream>#include <limits.h>#include <string.h>#include <string>#i

#include <bits/stdc++.h>using namespace std;const int maxn = 1e5 + 10;int nxt[maxn];// find s in tint kmp(char *s, char *t) { int ret = 0; int m = strlen(s); nxt[0] = -1; for (int i