Gym - 101864J Non Super Boring Substring(Manache + 树状数组)
B - Non Super Boring Substring(非超级无聊字串)Gym - 101864J题面You'll be given a string S and an integer K. You have to find the number of non super-boring substring inside S. A substring is called super-boring if it contains any palindromic substring of len.
原创
2022-04-26 22:52:48 ·
113 阅读 ·
0 评论