[kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher 题解

最新推荐文章于 2021-08-26 12:17:14 发布

置顶

ljq真的不能再吃了

最新推荐文章于 2021-08-26 12:17:14 发布

阅读量278

点赞数

分类专栏： ACM KMP Trie Manacher

本文链接：https://blog.csdn.net/heucodesong/article/details/81675561

版权

本文详细介绍了KMP、扩展KMP和Manacher三种字符串匹配算法，探讨了它们的工作原理和应用场景，并通过实例解析了这些算法的实现细节。其中，Manacher算法在处理回文串问题上具有独特优势。

摘要由CSDN通过智能技术生成

#include <cstdio>
#include <cstring>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <sstream>
#include <map>
using namespace std;
const int MAX_N = 1000024;
int mo[MAX_N],str[MAX_N];
int Next[MAX_N];
int n2,n1;
void getnext(){
   int i = 0,j = -1;
   while(i<n2){
    if(j==-1||str[i]==str[j]) {++i,++j,Next[i] = j;}
    else j = Next[j];
   }
   return;
}
int kmp(){
   int i = 0,j = 0;
   while(i<n1){
    if(j==-1||mo[i]==str[j]) i++,j++;
    else j = Next[j];
    if(j==n2) return i-n2+1;
   }
   return -1;
}
int main(){
    int t;
    scanf("%d",&t);
    while(t--){
        memset(Next,0,sizeof(Next));
        scanf("%d%d",&n1,&n2);
        for(int i = 0;i<n1;i++){
            i==(n1-1)?scanf("%d",&mo[i]):scanf("%d",&mo[i]);
           // printf("%d",mo[i]);
        }
        mo[n1] = '\0';
        //getchar();
        //printf("%s\n",mo);
        for(int i = 0;i<n2;i++){
            i==(n2-1)?scanf("%d",&str[i]):scanf("%d",&str[i]);
            //printf("%d",str[i]);
        }
        str[n2] = '\0';
        //printf("%s\n",str);
        Next[0] = -1;
        getnext();
        printf("%d\n",kmp());

    }
    return 0;
}

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
const int MAX_N = 10024;
char str[1000024];
char mo[MAX_N];
int Next[MAX_N];
int n2,n1;
void getnext(){
   int i = 0,j = -1;
   while(i<n2){
    if(j==-1||mo[i]==mo[j]) {++i,++j,Next[i]=j;}
    else j = Next[j];
   }
   return;
}
int kmp(){
   int ans = 0;
   int i = 0,j = 0;
   while(i<n1){
    if(j==-1||str[i]==mo[j]) {++i,++j;}
    else j = Next[j];
    if(j==n2) ans++;
   }
   return ans;
}
int main(){
   int t;
   scanf("%d",&t);
   while(t--){
    memset(Next,0,sizeof(Next));
    scanf("%s",mo);
    scanf("%s",str);
    n1 = strlen(str);
    n2 = strlen(mo);
    Next[0] = -1;
    getnext();
    printf("%d\n",kmp());
   }
   return 0;
}

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
using namespace std;
const int MAX_N  = 100024;
int Next[MAX_N];
int n1,n2;
char mo[MAX_N],str[MAX_N];
void getnext(){
   int i = 0,j = -1;
   while(i<n2){
    if(j==-1||mo[i]==mo[j]){++i,++j,Next[i] = j;}
    else j = Next[j];
   }
   return ;
}
int kmp(){
   int ans = 0,i = 0,j = 0;
   while(i<n1){
    if(j==-1||str[i]==mo[j]) {++i,++j;}
    else j = Next[j];
    if(j==n2)
    {
        j = 0;
        ans++;
    }
   }
   return ans;
}
int main(){
   while(scanf("%s",str)){
    if(str[0]=='#') break;
    memset(Next,0,sizeof(Next));
    scanf("%s",mo);
    n1 = strlen(str);
    n2 = strlen(mo);
    Next[0] = -1;
    getnext();
    printf("%d\n",kmp());
   }
   return 0;
}

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
const int MAX_N = 100024;
int Next[MAX_N];
char mo[MAX_N];
int n2;
void getnext(){
   int i = 0,j = -1;
   while(i<n2){
    if(j==-1||mo[i]==mo[j]){++i,++j,Next[i]=j;}
    else j = Next[j];
   }
   return;
}
int main(){
   int t;
   scanf("%d",&t);
   while(t--){
    memset(Next,0,sizeof(Next));
    scanf("%s",mo);
    n2 = strlen(mo);
    Next[0] = -1;
    getnext();
    if(n2-Next[n2]==1||(n2%(n2-Next[n2])==0&&n2/(n2-Next[n2])!=1)) printf("0\n");
    else if(n2/(n2-Next[n2])==1&&n2%(n2-Next[n2])==0) printf("%d\n",n2-Next[n2]);
    else printf("%d\n",n2-Next[n2]-n2%(n2-Next[n2]));
   }
   return 0;
}

#include <cstdio>
#include <iostream>
#include <cmath>
#include <cstring>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
const int MAX_N = 1000024;
int Next[MAX_N];
char mo[MAX_N];
int n2;
void getnext(){
   int i = 0,j=-1;
   while(i<n2){
    if(j==-1||mo[i]==mo[j]){++i,++j,Next[i]=j;}
    else j =Next[j];
   }
   return ;
}
int main(){
    int cnt = 0;
   while(scanf("%d",&n2)&&n2){
    memset(Next,0,sizeof(Next));
    scanf("%s",mo);
    printf("%Test case #%d\n",++cnt);
    Next[0] = -1;
    getnext();
    for(int i =0;i<n2;++i){
           // dbg(i+1);
            //dbg(i+1-Next[i+1]);
        if(((i+1)%(i+1-Next[i+1]))==0&&((i+1)/(i+1-Next[i+1])!=1)) {
            printf("%d %d\n",i+1,(i+1)/(i+1-Next[i+1]));
        }
    }
    printf("\n");
   }
   return 0;
}

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int MAX_N = 1000024;
int Next[MAX_N];
char mo[MAX_N];
int n2;
void getnext(){
   int i = 0,j = -1;
   while(i<n2){
    if(j==-1||mo[i]==mo[j]) {++i,++j,Next[i]=j;}
    else j = Next[j];
   }
   return ;
}
int main(){
   while(scanf("%s",mo)){
    if(mo[0]=='.') break;
    memset(Next,0,sizeof(Next));
    n2 = strlen(mo);
    Next[0] = -1;
    getnext();
    if(n2%(n2-Next[n2])==0) printf("%d\n",n2/(n2-Next[n2]));
    else printf("1\n");
   }
   return 0;
}

#include <cstdio>
#include <iostream>
#include <cstring>
using namespace std;
const int MAX_N = 400024;
int Next[MAX_N],ans[MAX_N];
char mo[MAX_N];
int n2;
void getnext(){
   int i = 0,j = -1;
   while(i<n2){
    if(j==-1||mo[i]==mo[j]) {++i,++j,Next[i]=j;}
    else j=Next[j];
   }
   return ;
}
int main(){
   while(scanf("%s",mo)!=EOF){
    n2 = strlen(mo);
    Next[0] = -1;
    getnext();
    int cnt = 0;
    ans[cnt++] = n2;
    int j = n2;
    while(Next[j]!=0){
        ans[cnt++] = Next[j];
        j = Next[j];
    }
    for(int i = cnt-1;i>=0;i--){
        i==0?printf("%d\n",ans[i]):printf("%d ",ans[i]);
    }
   }
   return 0;
}

#include <cstdio>
#include <iostream>
#include <cstring>
#include <algorithm>
#include <cmath>
using namespace std;
string str[15];
int Next[150];
void getnext(string str){
   Next[0] = -1;
   int n2 = str.length();
   int i = 0,j =-1;
   while(i<n2){
    if(j==-1||str[i]==str[j]){++i,++j,Next[i]=j;}
    else j =Next[j];
   }
   return ;
}
int kmp(string str,string mo){
   int n2 = mo.length();
   int n1 = str.length();
   int i= 0,j=0;
   while(i<n1){
    if(j==-1||str[i]==mo[j]) {++i,++j;}
    else j = Next[j];
    if(j==n2) return 1;
   }
   return 0;
}
int main(){
    ios::sync_with_stdio(false);
   int t;
   cin >> t;
   while(t--){
   int n;
   cin >>n;
   for(int i = 1;i<=n;++i)
    cin >> str[i];
    string str_ans;
    int maxx = 2;
    int flag2 = 0;
   for(int i = 0;i<60;i++){
    for(int j = 1;j<60-i+1;j++){
        int flag = 0;
        string str_now = str[1].substr(i,j);