KLChen的博客

循环节变种。使之成为循环 #include <cstdio> #include <cstring> using namespace std; const int MAX_N = 1000100; #define sci(num) scanf("%d",&num) char str[MAX_N],ps[MAX_N]; int nxt[MA

数字版kmp #include <bits/stdc++.h> using namespace std; const int MAX_N = 1000100; const int MAX_M = 10010; #define sci(num) scanf("%d",&num) int str[MAX_N],ps[MAX_M]; int nxt[MAX_M]; int lents...

更改更新后的令j =nxt[j] 不能让j =0 i再回退 会被卡掉 #include <cstdio> #include <cstring> using namespace std; const int MAX_N = 1000100; const int MAX_M = 10010; #define sci(num) scanf("%d",&num) cha

可有定义得到到i - nxt[i] 为循环节 且要使之能够整除 #include <cstdio> #include <cstring> using namespace std; const int MAX_N = 1000100; const int MAX_M = 10010; #define sci(num) scanf("%d",&num)

循环节的变种 类似POJ 1961 #include <cstdio> #include <cstring> using namespace std; const int MAX_N = 1000100; const int MAX_M = 10010; #define sci(num) scanf("%d",&num) char str[MAX_N]; int