Codeforces. Programming competitions and contests, programming community
https://codeforces.com/contest/625/problem/B 此题为统计出现次数,所以最后的部分不是直接推出而是继续匹配 k=-1意味着当前位无需判断,继续匹配下一位即可 下为id:199943666的提交的代码 void get_nxt() { int j=0,k=-1,len=strlen(a); nxt[0]=-1; while(j<len-1) { if(k==-1||a[j]==a...
=S时,反之。 #include<iostream>#include<cmath>#include<cstring>#include<queue>#include<vector>#include<cstdio>#include<algorithm>#include#include<set>#definerep(i,e) for(int i=0;i<(e);i++)#definerep1(i,e) for(int i=1;i<=(e);i++)#definerepx(i,x,e) for(int i=(x);i<=(...
#include <algorithm> #define M 100100 #define MOD 999911657 #define BASE 2333 using namespace std; int n,ans; char s[M],rev_s[M]; int next[M],f[M],pos[M]; pair<int,int> intervals[M]; int log_2[M],a[M][17],_ans[M]; void KMP() { int i,fix=0; for(i=2;i<=n;i...
problem=1268&language=english&type=pdf Sorry for my poor English. Thanks a lot. However, we don't need to use actual KMP algorithm, just the idea.
#include<set> #include<algorithm> #define ll long long #define oo 1000000007 #define pi acos(-1.0) #define MAXN 1000005 usingnamespacestd; intfail[MAXN],len; boolF[MAXN]; chars[MAXN]; voidkmp() { inti,k; memset(fail,0,sizeof(fail)); ...
#include<iostream> #include<algorithm> #include<cstring> #define IOS ios::sync_with_stdio(false) using namespace std; const int maxn=1e6+10; const int maxm=10010; int w[maxm],t[maxn]; int ne[maxm]; int n; int main(){ IOS;cin.tie(0); cin>>n; while(n--){ int x,y; ...
#include <cstdio> #include <cstring> #include <iostream> #include <algorithm> using namespace std; #pragma comment(linker, "/STACK:1024000000,1024000000") typedef long long ll; #define lson l, mid, rt<<1 #define rson mid+1, r, rt<<1|1 template <class T> inline bool rd(T &ret...
题解: fail指针 + KMP的next数组 使用AC自动机的fail指针和KMP的next数组概念提高查询(模式匹配)速度 #include"stdafx.h"#include<iostream>#include<cstdio>#include<algorithm>#include<string>#include<cstring>#include<vector>#include<cmath>#include<set>#include<queue>#include<stack>usingnamespacestd;const...
Codeforces - MUH and Cube Walls 本页面主要译自博文 Префикс-функция. АлгоритмКнута-Морриса-Пратта 与其英文翻译版 Prefix function. Knuth–Morris–Pratt algorithm 。其中俄文版版权协议为 Public Domain + Leave a Link;英文版版权协议为 CC-BY-SA...