摘要：
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 @ 2017-01-13 22:33
19992147
阅读(182)
评论(0)
推荐(0)
摘要：
matrix67 nxt[i]：[1-i]中最长公共前后缀的长度 阅读全文
posted @ 2017-01-13 20:40
19992147
阅读(123)
评论(0)
推荐(0)
摘要：
Asterix, Obelix and their temporary buddies Suffix and Prefix has finally found the Harmony temple. However, its doors were firmly locked and even Obe 阅读全文
posted @ 2017-01-13 20:38
19992147
阅读(1020)
评论(0)
推荐(2)
浙公网安备 33010602011771号