2015年1月10日
spoj 7258
摘要： Lexicographical Substring SearchTime Limit: 1000MSMemory Limit: Unknown64bit IO Format: %lld & %lluDescriptionLittle Daniel loves to play with strings... 阅读全文
posted @ 2015-01-10 21:22 Mr.Ren～ 阅读(187) 评论(0) 推荐(0) 编辑
poj 3415
摘要： Common SubstringsTime Limit: 5000MSMemory Limit: 65536KTotal Submissions: 7605Accepted: 2524DescriptionA substring of a string T is defined as:T(i, k)... 阅读全文
posted @ 2015-01-10 20:55 Mr.Ren～ 阅读(200) 评论(0) 推荐(0) 编辑
spoj 8222
摘要： 8222. SubstringsProblem code: NSUBSTRYou are given a string S which consists of 250000 lowercase latin letters at most. We define F(x) as the maximal ... 阅读全文
posted @ 2015-01-10 20:31 Mr.Ren～ 阅读(381) 评论(0) 推荐(0) 编辑
hdu 4918
摘要： 一道比较好的树分治的题目.大力推荐~Query on the subtreeTime Limit: 16000/8000 MS (Java/Others)Memory Limit: 131072/131072 K (Java/Others)Total Submission(s): 479Accept... 阅读全文
posted @ 2015-01-10 19:52 Mr.Ren～ 阅读(385) 评论(0) 推荐(0) 编辑