字典树
shuangyueliao
这个作者很懒,什么都没留下…
展开
-
统计难题
http://acm.hdu.edu.cn/showproblem.php?pid=1251#include#includeusing namespace std;struct trie{ int count; trie *next[26];};trie *root;trie *create(){ trie *t=(trie*)malloc(原创 2015-06-16 21:31:01 · 557 阅读 · 0 评论 -
Repository
http://acm.hdu.edu.cn/showproblem.php?pid=2846#includeusing namespace std;struct trie{ int count; int order; trie *next[26]; };trie *root;trie *build(){ trie *t;原创 2015-06-16 23:48:29 · 445 阅读 · 0 评论 -
What Are You Talking About
http://acm.hdu.edu.cn/showproblem.php?pid=1075#include#includeusing namespace std;char book[3010];struct trie{ trie *next[26]; char ch1[15]; int flag;};trie *root;trie *bui原创 2015-06-19 12:07:59 · 382 阅读 · 0 评论 -
Phone List
http://acm.hdu.edu.cn/showproblem.php?pid=1671#includeusing namespace std;int ok;struct trie{ int flag; trie *next[10];};trie *root;trie *newtrie(){ trie *t; t=(trie*)mal原创 2015-07-01 22:27:19 · 438 阅读 · 0 评论 -
Hat’s Words
http://acm.hdu.edu.cn/showproblem.php?pid=1247http://www.2cto.com/kf/201402/279681.html//1247#include#include#includeusing namespace std;char a[50010][52];char tmp1[52],tmp2[52];原创 2015-06-15 12:21:27 · 316 阅读 · 0 评论 -
字典树模板
http://blog.csdn.net/xiaotaoqibao/article/details/5805163转载 2015-06-14 21:37:17 · 347 阅读 · 0 评论