方法择优即可,正所谓码不在多,能过即可 by Offending_user_name_ @ 2023-10-04 21:11:13
抱歉说错了,复杂度应该是O(nk),st表的查找是O(1)的,枚举加二分是O(nlog(n)),但预处理是O(nk)的 by consequence @ 2023-10-04 21:18:27