后缀自动机
wang3312362136
这个作者很懒,什么都没留下…
展开
-
BZOJ 3998 [TJOI2015]弦论
Description 对于一个给定长度为N的字符串,求它的第K小子串是什么。 Input 第一行是一个仅由小写英文字母构成的字符串S 第二行为两个整数T和K,T为0则表示不同位置的相同子串算作一个。T=1则表示不同位置的相同子串算作多个。K的意义如题所述。 Output 输出仅一行,为一个数字串,为第K小的子串。如果子串数目不足K个,则输出-1 Sample Input ...原创 2018-02-28 10:03:33 · 146 阅读 · 0 评论 -
POJ 1509 Glass Beads
Once upon a time there was a famous actress. As you may expect, she played mostly Antique Comedies most of all. All the people loved her. But she was not interested in the crowds. Her big hobby were b...原创 2018-02-22 15:03:35 · 186 阅读 · 0 评论 -
算法详解——后缀自动机
由于最近CSDN对Markdown的支持不好,因此贴出Markdown代码:https://paste.ubuntu.com/p/Wd8PJnnxTf/ DFA ////////////////////////////////////////////////////////////////////////// DFA,即确定性有限状态自动机,由一个五元组M=(Σ,Q,qs,F,tr)M=(Σ...原创 2018-02-22 17:39:28 · 246 阅读 · 0 评论 -
SPOJ LCS Longest Common Substring
A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called factor, is a consecutive sequence of characters oc...原创 2018-02-23 10:56:20 · 169 阅读 · 0 评论 -
SPOJ LCS2 Longest Common Substring II + BZOJ 2946 [Poi2000]公共串
A string is finite sequence of characters over a non-empty finite set Σ. In this problem, Σ is the set of lowercase letters. Substring, also called factor, is a consecutive sequence of characters oc...原创 2018-02-24 11:40:23 · 107 阅读 · 0 评论