摘要：struct node { vector<int> exist; node *fail; node *child[26]; node() { fail = NULL; for (int i = 0; i < 26; i++) { child[i] = NULL; } } }; void insert 阅读全文

摘要：int trie[MAXN][26]; int color[MAXN]; int k = 1; void insert(char *s) { int len = strlen(s); int p = 0; for(int i = 0; i < len; i++) { int c = s[i] - ' 阅读全文

摘要：这波，这波是上手进行康复训练 char s[MAXN], s1[MAXN]; int nex[MAXN]; void make_next() { int i = 0, j = -1; int len = strlen(s); nex[0] = -1; while(i < len) { if(j == 阅读全文