苍竹林

# include # include # include # include using namespace std; # define kind 128 struct node { node *fail;//失败指针 node *next[kind];//树每个节点的子节点 trie树的分支是128的 int cnt;//是否为该单词的最后一个节点

//可能有重复单词 # include # include # include # include using namespace std; char str[110],a[1000010]; # define kind 26 struct node { node *fail; node *next[kind]; int cnt;//从根到此处是否是关键字,并且记录

///要求记录子串在匹配串重复出现的个数 # include # include # include # include using namespace std; # define kind 128 struct node { node *fail; node *next[kind]; int cnt;//是否为该单词的最后一个节点 // int index;