2018年12月
LCS2 - Longest Common Substring II(spoj1812)(sam(后缀自动机)+多串LCS)
摘要： A string is finite sequence of characters over a non empty finite set $\sum$. In this problem, $\sum$ is the set of lowercase letters. Substring, also 阅读全文
posted @ 2018-12-10 18:39 整理者 阅读(204) 评论(0) 推荐(0)
LCS - Longest Common Substring(spoj1811) (sam(后缀自动机)+LCS)
摘要： A string is finite sequence of characters over a non empty finite set $\sum$. In this problem, $\sum$ is the set of lowercase letters. Substring, also 阅读全文
posted @ 2018-12-10 18:26 整理者 阅读(208) 评论(0) 推荐(0)
Lexicographical Substring Search (spoj7259) (sam(后缀自动机)+第k小子串)
摘要： Little Daniel loves to play with strings! He always finds different ways to have fun with strings! Knowing that, his friend Kinan decided to test his 阅读全文
posted @ 2018-12-10 17:54 整理者 阅读(389) 评论(0) 推荐(0)
Substrings(SPOJ8222) (sam(后缀自动机))
摘要： You are given a string $S$ which consists of 250000 lowercase latin letters at most. We define $F(x)$ as the maximal number of times that some string 阅读全文
posted @ 2018-12-10 17:36 整理者 阅读(175) 评论(0) 推荐(0)