Educational Codeforces Round 32 E. Maximum Subsequence[折半搜索+二分+状压枚举] 好题!