字典树
蒟蒻的ACMer
2014界大学新生
展开
-
HDU 2072 单词数 字典树
G - 单词数Time Limit:1000MS Memory Limit:32768KB 64bit IO Format:%I64d & %I64uSubmit StatusDescriptionlily的好朋友xiaoou333最近很空,他想了一件没有什么意义的事情,就是统计一篇文章里不同单词的总数。下面你的任务是帮助xiaoou333解决这原创 2016-05-11 18:46:50 · 537 阅读 · 0 评论 -
POJ 2503 Babelfish qsort+bserach OR 字典树
BabelfishTime Limit: 3000MS Memory Limit: 65536KTotal Submissions: 36951 Accepted: 15743DescriptionYou have just moved from Waterloo to a big city. The people her原创 2015-08-19 17:33:09 · 1107 阅读 · 0 评论 -
POJ 2418 Hardwood Species stl真省代码啊 或者字典树
Hardwood SpeciesTime Limit: 10000MS Memory Limit: 65536KTotal Submissions: 20811 Accepted: 8158DescriptionHardwoods are the botanical group of trees that have broad原创 2015-08-20 16:07:19 · 1453 阅读 · 0 评论 -
POJ 1056 IMMEDIATE DECODABILITY 字典树
IMMEDIATE DECODABILITYTime Limit: 1000MS Memory Limit: 10000KTotal Submissions: 12331 Accepted: 5862DescriptionAn encoding of a set of symbols is said to be immed原创 2015-10-20 12:07:51 · 563 阅读 · 0 评论 -
POJ 2001 Shortest Prefixes 字典树
Shortest PrefixesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 15941 Accepted: 6883DescriptionA prefix of a string is a substring starting at the begi原创 2015-10-20 16:18:13 · 474 阅读 · 0 评论 -
HDU 1251 统计难题 字典树
G++超内存G++超内存G++超内存统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 26136 Accepted Submission(s): 10614Problem D原创 2015-10-20 17:29:15 · 502 阅读 · 0 评论 -
POJ 3630 Phone List 静态字典树
Phone ListTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 25670 Accepted: 7772DescriptionGiven a list of phone numbers, determine if it is consistent in原创 2015-10-20 21:35:13 · 549 阅读 · 0 评论 -
HDU 2864 Repository 字典树
RepositoryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 3351 Accepted Submission(s): 1256Problem DescriptionWhen you go shoppin原创 2015-10-31 13:17:20 · 599 阅读 · 0 评论 -
大二专题第一周 E - Hyper Prefix Sets
应该是uva的题目比较水数组大小开错re一次规定最大串长为 最长前缀*有此前缀的个数ACcode:#pragma warning(disable:4786)//使命名长度不受限制#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈#include #include #include #include #inc原创 2015-11-01 00:21:18 · 578 阅读 · 0 评论 -
大二训练第一周 F - Remember the Word trie树加dp
大白书上说 dp[i]=sum(dp[i]+dp[i+len(x)]初始化dp[len]=1然后递推回去ACcode:#pragma warning(disable:4786)//使命名长度不受限制#pragma comment(linker, "/STACK:102400000,102400000")//手工开栈#include #include #include #inclu原创 2015-11-07 14:02:44 · 1017 阅读 · 0 评论 -
山东省第一届ACM大学生程序设计竞赛 Phone Number 字典树
Phone NumberTime Limit: 1000ms Memory limit: 65536K 有疑问?点这里^_^题目描述We know that if a phone number A is another phone number B’s prefix, B is not able to be called. For an example, A is原创 2016-03-30 20:54:04 · 974 阅读 · 0 评论