初遇KMP

最新推荐文章于 2022-05-18 16:53:08 发布

Chen丶HC

最新推荐文章于 2022-05-18 16:53:08 发布

阅读量187

点赞数

分类专栏： KMP

本文链接：https://blog.csdn.net/chcnsn/article/details/77188825

版权

KMP 专栏收录该内容

1 篇文章 0 订阅

订阅专栏

HDUOJ 2087 剪花布条
KMP求不可重叠子串数

#ifdef _DEBUG
#pragma warning(disable : 4996)
#endif
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define CLOSE() ios::sync_with_stdio(false)
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define PF(a) printf("%d\n", a)
#define SF(a) scanf("%d", &a)
#define SFF(a, b) scanf("%d%d", &a, &b)
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 1005
#define maxm 10005
#define MOD  2000000000
#define INF 10007
using namespace std;
//-------------------------CHC------------------------------//
char s[maxn], t[maxn];
int nxt[maxn], slen, tlen;

void GetNext() {
	int i = 0, j = -1;
	nxt[0] = -1;
	while (i < tlen) {
		if (j == -1 || t[i] == t[j]) ++i, ++j, nxt[i] = j;
		else j = nxt[j];
	}
}

int KMP() {
	int i = 0, j = 0, cnt = 0;
	GetNext();
	while (i < slen) {
		j = 0;
		while (i < slen && j < tlen) {
			if (j == -1 || s[i] == t[j]) ++i, ++j;
			else j = nxt[j];
		}
		if (j == tlen) cnt++;
	}
	return cnt;
}

int main() {
	while (scanf("%s", s)) {
		if (s[0] == '#') break;
		scanf("%s", t);
		slen = strlen(s), tlen = strlen(t);
		int ans = KMP();
		PF(ans);
	}
	return 0;
}

POJ 2406 Power Strings
nxt数组求循环次数
i%(i-next(i))==0 说明开始循环了。

#ifdef _DEBUG
#pragma warning(disable : 4996)
#endif
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define CLOSE() ios::sync_with_stdio(false)
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define PF(a) printf("%d\n", a)
#define SF(a) scanf("%d", &a)
#define SFF(a, b) scanf("%d%d", &a, &b)
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 1000005
#define maxm 10005
#define MOD  2000000000
#define INF 10007
using namespace std;
//-------------------------CHC------------------------------//
int nxt[maxn], len;
char s[maxn];

void GetNext() {
	int i = 0, j = -1;
	nxt[0] = -1;
	while (i < len) {
		if (j == -1 || s[i] == s[j]) ++i, ++j, nxt[i] = j;
		else j = nxt[j];
	}
}

int main() {
	while (scanf("%s", s) && strcmp(s, ".")) {
		len = strlen(s);
		GetNext();
		if (len % (len - nxt[len]) == 0) PF(len / (len - nxt[len]));
		else PF(1);
	}
	return 0;
}

HDUOJ 3336 Count the string
next数组的意义，真前后最大相同串的长度。
参考 http://972169909-qq-com.iteye.com/blog/1114968
dp思路不太清楚诶。。。

#ifdef _DEBUG
#pragma warning(disable : 4996)
#endif
#include <iostream>
#include <string>
#include <vector>
#include <stack>
#include <queue>
#include <deque>
#include <set>
#include <map>
#include <algorithm>
#include <functional>
#include <sstream>
#include <utility>
#include <cstring>
#include <cstdio>
#include <cstdlib>
#include <ctime>
#include <cmath>
#include <cctype>
#define CLEAR(a, b) memset(a, b, sizeof(a))
#define CLOSE() ios::sync_with_stdio(false)
#define IN() freopen("in.txt", "r", stdin)
#define OUT() freopen("out.txt", "w", stdout)
#define PF(a) printf("%d\n", a)
#define SF(a) scanf("%d", &a)
#define SFF(a, b) scanf("%d%d", &a, &b)
#define SFFF(a, b, c) scanf("%d%d%d", &a, &b, &c)
#define FOR(i, a, b) for(int i = a; i < b; ++i)
#define LL long long
#define maxn 200005
#define maxm 10005
#define MOD  10007
#define INF 10007
using namespace std;
//-------------------------CHC------------------------------//
int len, nxt[maxn];
char s[maxn];

void GetNext() {
	int i = 0, j = -1;
	nxt[0] = -1;
	while (i < len) {
		if (j == -1 || s[i] == s[j]) ++i, ++j, nxt[i] = j;
		else j = nxt[j];
	}
}

int main() {
	int T;
	SF(T);
	while (T--) {
		SF(len);
		scanf("%s", s);
		GetNext();
		int ans = len + nxt[len];
		FOR(i, 0, len) {
			if (nxt[i] > 0 && nxt[i] + 1 != nxt[i + 1])
				ans += nxt[i], ans %= MOD;
		}
		PF(ans);
	}
	return 0;
}