2013年8月6日

HDU 4622 Reincarnation (查询一段字符串的不同子串个数,后缀自动机)

摘要: ReincarnationTime Limit: 6000/3000 MS (Java/Others)Memory Limit: 131072/65536 K (Java/Others)Total Submission(s): 843Accepted Submission(s): 283Problem DescriptionNow you are back,and have a task to do:Given you a string s consist of lower-case English letters only,denote f(s) as the number of disti 阅读全文

posted @ 2013-08-06 09:18 kuangbin 阅读(3672) 评论(0) 推荐(0) 编辑

导航

JAVASCRIPT: