摘要: G2. Division + LCP (hard version) This is the hard version of the problem. In this version $l\le r$. You are given a string $s$. For a fixed $k$, cons 阅读全文
posted @ 2024-05-03 20:10 onlyblues 阅读(63) 评论(0) 推荐(0) 编辑
Web Analytics