摘要:
Meet in the middle Search E. Maximum Subsequence F - Programming Contest F - XOR on Grid Path F - Robot Rotation 阅读全文
摘要:
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 阅读全文