典型的Trie树, 算是复习一下字符串吧, 就是输入有点恶心,代码如下:
#include <cstdio> #include <cstring> #include <algorithm> using namespace std; const int maxn = 500000+100; struct Trie{ bool isword; int next[26]; char words[15]; Trie(){ memset(next, -1, sizeof(next)); isword = false; } }Root; Trie node[maxn]; int n; void Insert(char *tar){ Trie *head = &Root; char *s = tar; while(*tar!=' ') tar++; *tar='