2017年9月30日
SPOJ - LCS 后缀自动机入门
摘要： 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 let 阅读全文
posted @ 2017-09-30 22:11 meekyan 阅读(346) 评论(0) 推荐(0)
HDU 4622 Reincarnation 后缀自动机 // BKDRHash（最优hash）
摘要： Reincarnation Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 131072/65536 K (Java/Others) Problem Description Now you are back,and have a task t 阅读全文
posted @ 2017-09-30 15:20 meekyan 阅读(302) 评论(0) 推荐(0)