Educational Codeforces Round 32

Local Extrema

Solution

Buggy Robot

Solution

K-Dominant Character

Solution

Almost Identity Permutations

Solution

Maximum Subsequence

meet in the middle，基于分治的思想，每次解决部分问题，然后合并起来，形式上跟动态规划和搜索不太一样。

Solution

Connecting Vertices

Xor-MST