KMP
Keep_Trying_Go
无
展开
-
HDU3065
方法一:KMP-超时 #include<iostream> #include<algorithm> #include<cstring> #include<cmath> using namespace std; const int maxx=1e3+10; int nexts[maxx]; string s[maxx]; int n; void getnext(string s){ int i=0,j=-1; nexts[0]=-1; int len=s.原创 2021-03-11 00:06:49 · 110 阅读 · 0 评论 -
HDU1711
#include<iostream> #include<algorithm> #include<cmath> #include<cstring> #include<set> #include<map> #include<vector> #include<cstdio> using namespace std; int next[10005]; int a[10005],b[10005]; int n,m; voi原创 2021-03-09 00:01:23 · 62 阅读 · 0 评论 -
HDU2087
#include<iostream> #include<algorithm> #include<cmath> #include<vector> #include<cstring> #include<set> #include<map> using namespace std; int nexts[1005]; string a,b; int ans; void Getnext(){ int len=b.length();原创 2021-03-09 00:01:37 · 125 阅读 · 0 评论 -
HDU1686
#include<iostream> #include<algorithm> #include<cmath> #include<vector> #include<cstring> #include<set> #include<map> using namespace std; int nexts[10005]; char a[1000005],b[10005]; int ans; void Getnext(){ int l原创 2021-03-09 00:01:48 · 77 阅读 · 0 评论 -
HDU1358
KMP问题: #include<iostream> #include<algorithm> #include<cstdio> #include<cmath> #include<cstring> using namespace std; int nexts[100000005]; int ans; void Getnext(string a){ int len=a.length(); int i=0,j=-1; nexts[0]=-1; wh原创 2021-03-09 00:01:59 · 66 阅读 · 0 评论