![](https://img-blog.csdnimg.cn/20201014180756738.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
Trie
ljq真的不能再吃了
珍惜每一天
展开
-
HDOJ 1251 Trie树模板题
统计难题Time Limit: 4000/2000 MS (Java/Others) Memory Limit: 131070/65535 K (Java/Others)Total Submission(s): 52621 Accepted Submission(s): 18402Problem DescriptionIgnatius最近遇到一个难题,老师交给他很多单词(只有小写字母组...原创 2018-07-11 23:27:43 · 142 阅读 · 0 评论 -
hdoj 2072 水题但是有点坑 Trie树
单词数Time Limit: 1000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others)Total Submission(s): 63793 Accepted Submission(s): 15905Problem Descriptionlily的好朋友xiaoou333最近很空,他想了一件没有什么意义的事情...原创 2018-07-12 00:31:10 · 164 阅读 · 0 评论 -
POJ 3630 Trie树
Phone ListTime Limit: 1000MS Memory Limit: 65536KTotal Submissions: 33374 Accepted: 9643DescriptionGiven a list of phone numbers, determine if it is consistent in the sense that no number is the prefi...原创 2018-07-12 15:35:26 · 111 阅读 · 0 评论 -
POJ 2001 Shortest Prefixes Trie树
Shortest PrefixesTime Limit: 1000MS Memory Limit: 30000KTotal Submissions: 20904 Accepted: 9001DescriptionA prefix of a string is a substring starting at the beginning of the given string. The prefixe...原创 2018-07-12 16:22:47 · 121 阅读 · 0 评论 -
HDU 1075 What Are You Talking About Trie树
What Are You Talking AboutTime Limit: 10000/5000 MS (Java/Others) Memory Limit: 102400/204800 K (Java/Others)Total Submission(s): 27312 Accepted Submission(s): 9296Problem DescriptionIgnatius is...原创 2018-07-12 16:40:37 · 121 阅读 · 0 评论 -
HDOJ 2846 Repository 字典树
RepositoryTime Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others)Total Submission(s): 7006 Accepted Submission(s): 2210Problem DescriptionWhen you go shopping, you can s...原创 2018-07-12 20:02:54 · 234 阅读 · 0 评论 -
[kuangbin带你飞]专题十六 KMP & 扩展KMP & Manacher 题解
A#include <cstdio>#include <cstring>#include <cmath>#include <algorithm>#include <iostream>#include <sstream>#include <map>using namespace std;cons原创 2018-08-14 22:11:12 · 267 阅读 · 0 评论 -
UVA 1401 Trie图加dp
题目粘贴不过来样例abcd 4abcdababcd=a+b+cd;abcd=ab+cd;答案就是两种 题目就是问你 给你一个串能被下面的串有几种方式组成我们怎么考虑这个问题呢?我们对下面所有字符串建一个Trie图 那么设置dpdp[i]就是从i开始到结束存在多少种方式 那么dp[i+j+1]如果存在cnt[now] (i+j<len) 那么后面的也...原创 2018-08-29 22:55:48 · 98 阅读 · 0 评论