LZY_Starry的博客

P3375 【模板】KMP字符串匹配 很久没看看算法了。 这是复习。 https://www.luogu.com.cn/problem/P3375 #include<cstdio> #include<iostream> #include<cstring> #include<vector> using namespace std; const int maxn = 1e6 + 7; char s1[maxn], s2[maxn]; int k_nex

It’s advantage is, LCP (Longest Common Prefix) of two of these strings is the LCA (Lowest Common Ancestor) of their nodes in the trie(a node that we can build the string by writing down the characters

简单trie： http://hihocoder.com/problemset/problem/1014// http://hihocoder.com/problemset/problem/1014 #include<bits/stdc++.h> #define pb push_back #define mp make_pair using namespace std;const int max

先贴一个讲的很好很详细的blog http://blog.youkuaiyun.com/v_july_v/article/details/7041827