2016年2月16日
后缀数组：SPOJ SUBST1 - New Distinct Substrings
摘要： Given a string, we need to find the total number of its distinct substrings. Input T- number of test cases. T<=20; Each test case consists of one stri 阅读全文
posted @ 2016-02-16 21:27 TenderRun 阅读(170) 评论(0) 推荐(0)