2020年4月18日
Codeforces Global Round 7 D2. Prefix-Suffix Palindrome (Hard version)（Manacher算法+输出回文字符串）
摘要： This is the hard version of the problem. The difference is the constraint on the sum of lengths of strings and the number of test cases. You can make 阅读全文
posted @ 2020-04-18 12:56 kongbursi 阅读(200) 评论(0) 推荐(0) 编辑