摘要: Incorrect solution: greedily find out how many consecutive S we can convert to all o. Then for the remaining replace operations, try each starting pos 阅读全文
posted @ 2023-09-14 05:13 Review->Improve 阅读(11) 评论(0) 推荐(0) 编辑