字典树
绝尘花遗落
一骑红尘妃子笑,无人知是荔枝来
展开
-
Good Firewall(字典树 HDU4760)
Good Firewall Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 32768/32768 K (Java/Others) Total Submission(s): 713 Accepted Submission(s): 203Problem Description Professor X is an expert原创 2015-09-05 18:52:09 · 665 阅读 · 0 评论 -
Manthan, Codefest 16 -C. Spy Syndrome 2
time limit per test 2 seconds memory limit per test 256 megabytes input standard input output standard output After observing the results of Spy Syndrome, Yash realised the errors of his w原创 2016-03-03 15:42:16 · 693 阅读 · 0 评论 -
【POJ1204】Word Puzzles——AC自动机
Time Limit: 5000MS Memory Limit: 65536K Total Submissions: 10594 Accepted: 4002 Special Judge DescriptionWord puzzles are usually simple and very entertaining for all ages. They are原创 2016-03-19 09:29:50 · 603 阅读 · 0 评论 -
51Nod——1295 XOR key(贪心+可持久化字典树)
51Nod 1295 XOR Key 题目来源: HackerRank 基准时间限制:1.5 秒 空间限制:262144 KB给出一个长度为N的正整数数组A,再给出Q个查询,每个查询包括3个数,L, R, X (L <= R)。求A[L] 至 A[R] 这R - L + 1个数中,与X 进行异或运算(Xor),得到的最大值是多少?Input第1行:2个数N, Q中间用空格分隔,分别表示数组的长度及查询原创 2016-08-24 21:53:19 · 716 阅读 · 0 评论 -
【Uvalive3942】Remember the Word——字典树+dp
uvalive 3942 给你一个模式串和一些匹配串,问模式串由匹配串组成的方案数。将匹配串建成字典树,在字典树上进行dp。#include <bits/stdc++.h>using namespace std;const int maxn = 310000; const int maxm = 123; const int mod = 20071027;struct node {原创 2016-10-17 20:16:43 · 399 阅读 · 0 评论