SPOJ(后缀数组求不同子串个数)
摘要:DISUBSTR - 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
阅读全文
posted @ 2016-03-02 21:54
posted @ 2016-03-02 21:54
posted @ 2016-03-01 21:34
posted @ 2016-03-01 20:58
posted @ 2016-03-01 17:44