09 2022 档案

[CodeForce] Maximum Subsequence
摘要：Problem Statement 1. N is up to 35, so trying all possible subsequences is too slow (2^35). We can apply the meet in the middle technique and divide A 阅读全文
posted @ 2022-09-30 10:48 Review->Improve 阅读(52) 评论(0) 推荐(0)