摘要: An interesting problem using suffix sum. For each wrong tries that is correct until after index p[i], we add 1 to cnt[p[i]]. This represents that all 阅读全文
posted @ 2020-03-01 06:31 Review->Improve 阅读(121) 评论(0) 推荐(0) 编辑