08 2019 档案

摘要:Aho Corasick algorithm Let there be a set of strings with the total length $m$ (sum of all lengths). The Aho Corasick algorithm constructs a data stru 阅读全文
posted @ 2019-08-20 20:22 SuuTTT 阅读(268) 评论(0) 推荐(0)
摘要:<! ?title Finding repetitions Finding repetitions Given a string $s$ of length $n$. A repetition is two occurrences of a string in a row. In other wor 阅读全文
posted @ 2019-08-20 20:21 SuuTTT 阅读(186) 评论(0) 推荐(0)
摘要:Suffix Automaton A suffix automaton is a powerful data structure that allows solving many string related problems. For example, you can search for all 阅读全文
posted @ 2019-08-20 20:20 SuuTTT 阅读(272) 评论(0) 推荐(0)
摘要:Z function and its calculation Suppose we are given a string $s$ of length $n$. The Z function for this string is an array of length $n$ where the $i$ 阅读全文
posted @ 2019-08-20 20:19 SuuTTT 阅读(234) 评论(0) 推荐(0)
摘要:Prefix function. Knuth–Morris–Pratt algorithm Prefix function definition You are given a string $s$ of length $n$. The prefix function for this string 阅读全文
posted @ 2019-08-20 20:18 SuuTTT 阅读(181) 评论(0) 推荐(0)
摘要:<! ?title Suffix Array Suffix Array Definition Let $s$ be a string of length $n$. The $i$ th suffix of $s$ is the substring $s[i \ldots n 1]$. A suffi 阅读全文
posted @ 2019-08-20 20:16 SuuTTT 阅读(609) 评论(0) 推荐(0)
摘要:知识点 计算几何基础 讲义 点 我们把点 $\mathbf r$ 看成从 $\mathbf 0$ 到 $\mathbf r$的向量 $\vec{\mathbf r}$ 点乘 1. $\mathbf a \cdot \mathbf b = \mathbf b \cdot \mathbf a$ 2. $ 阅读全文
posted @ 2019-08-17 21:12 SuuTTT 阅读(231) 评论(0) 推荐(0)
摘要:知识点 树状数组 解决问题类型: 单点更新,前缀查询,很简单地拓展到2维 复杂度即代码: python 例题 "UVA 12086 Potentiometers" "LOJ 1112 Curious Robin Hood" "LOJ 1266 Points in Rectangle" "Codech 阅读全文
posted @ 2019-08-16 21:25 SuuTTT 阅读(132) 评论(0) 推荐(0)
摘要:知识点 线段树 权值 树套树 二维 可持续 解决问题类型: 区间rmq即其他符合结合律的运算,支持区间更新。 想法题 1. 【二分】找第k个0:结点维护0的个数cnt[rt],然后在树上队cnt二分。 2. 【二分】找第k大(权值线段树):这个问题可以排序或 . 考虑线段树的做法,我们先将n个数离散 阅读全文
posted @ 2019-08-16 21:13 SuuTTT 阅读(139) 评论(0) 推荐(0)
摘要:Operations on polynomials and series In this article we will cover common operations that you will probably have to do if you deal with polynomials. B 阅读全文
posted @ 2019-08-14 16:39 SuuTTT 阅读(187) 评论(0) 推荐(0)
摘要:AtCoder 137 F 插值求系数 想法题 题意: "AtCoder 137 F" 已知:$f(x)$在p个点的值:$f(i) \equiv a_i \pmod p$ $(0 \leq i \leq p 1)$ 求:$f(x) = b_{p 1} x^{p 1} + b_{p 2} x^{p 2 阅读全文
posted @ 2019-08-13 22:24 SuuTTT 阅读(317) 评论(0) 推荐(0)
摘要:Burnside's lemma / Pólya enumeration theorem Burnside's lemma Burnside's lemma was formulated and proven by Burnside in 1897, but historically it was 阅读全文
posted @ 2019-08-08 22:21 SuuTTT 阅读(217) 评论(0) 推荐(0)
摘要:The Inclusion Exclusion Principle The inclusion exclusion principle is an important combinatorial way to compute the size of a set or the probability 阅读全文
posted @ 2019-08-08 22:05 SuuTTT 阅读(491) 评论(0) 推荐(0)