
数据结构_后缀数组
文章平均质量分 82
cq_phqg
心中的坚持与不懈的努力,梦想就在前方!
展开
-
UVALive 6711(2013长春区域赛)
Given a string S and two integers L and M, we consider a substring of S as “recoverable” if and only if (i) It is of length M ∗ L; (ii) It can be constructed by concatenating M “diversified” substri原创 2014-08-02 21:43:54 · 1021 阅读 · 0 评论 -
2014西安网络预选赛1002(后缀数组求第K大的子串)hdu5008
Boring String Problem Time Limit: 6000/3000 MS (Java/Others) Memory Limit: 65536/65536 K (Java/Others) Total Submission(s): 272 Accepted Submission(s): 65 Problem Description In this原创 2014-09-14 23:58:59 · 2004 阅读 · 0 评论