【模板】kmp+马拉车+trie树

kmp

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define ull unsigned long long
#define endl '\n'
const double pi = acos(-1);
const int maxn = 5e6 + 10;
const int maxm = 2e7 + 10;
const ll mod = 1e9+7;
char a[maxn], b[maxn];
int kmp[maxn];
int cnt;
int main(){
    scanf("%s", a + 1);
    scanf("%s", b + 1);
    int la = strlen(a + 1);
    int lb = strlen(b + 1);
    int j = 0;
    for(int i = 2 ; i <= lb ; ++ i){
        while(j && b[j + 1] != b[i]) j = kmp[j];
        if(b[j + 1] == b[i]) j ++;
        kmp[i] = j;
    }
    j = 0;
    for(int i = 1 ; i <= la ; ++ i){
        while(j && b[j + 1] != a[i]) j = kmp[j];
        if(b[j + 1] == a[i]) j ++;
        if(j == lb){
            cout << i - j + 1 << endl;
            j = kmp[j];
        }
    }
    for(int i = 1 ; i <= lb ; ++ i) cout << kmp[i] << ' ';
    return 0;
}

马拉车

#include<iostream>
#include<cstring>
#include<cstdio>
#include<queue>
#include<cstdlib>
#include<cmath>
#include<stack>
#include<map>
#include<string>
#include<vector>
#include<set>
#include<algorithm>
using namespace std;
#define ll long long
#define INF 0x3f3f3f3f
#define ull unsigned long long
#define endl '\n'
const double pi = acos(-1);
const int maxn = 2e7 + 10;
const int maxm = 2e7 + 10;
const ll mod = 1e9+7;
char a[maxn], b[maxn << 1];
int hw[maxn], maxi;
int main(){
    scanf("%s", a);
    int len = strlen(a);
    b[0] = b[1] = '?';
    for(int i = 0 ; i < len ; ++ i){
        b[(i<<1) + 2] = a[i];
        b[(i<<1) + 3] = '?';
    }
    int mr = 0, mid = 0;
    int n = (len << 1) + 2;
    b[n] = 0;
    for(int i = 1 ; i < n ; ++ i){
        if(i < mr){
            hw[i] = min(hw[mid] + mid - i, hw[(mid<<1)-i]);
        }
        else hw[i] = 1;
        while(b[i+hw[i]] == b[i-hw[i]]) ++ hw[i];
        if(i + hw[i] > mr) mr = i + hw[i], mid = i;

        maxi = max(maxi, hw[i]-1);
    }
    cout << maxi;
    return 0;
}

trie树

struct node{
    int tr[maxn][26], cnt;
    int e[maxn];
    void insert(char *s){
        int p = 0;
        for(int i = 0 ; s[i] ; ++ i){
            int k = s[i] - 'a';
            if(!tr[p][k]) tr[p][k] = ++ cnt;
            p = tr[p][k];
        }
        e[p] ++;
    }
};