Codeforces Round #680 (Div. 2) Divide and Sum
Description
You are given an arrayaaof length2n2n. Consider a partition of arrayaainto two subsequencesppandqqof lengthnneach (each element of arrayaashould be in exactly one subsequence: either inppor inqq).
Let's sortppin non-decreasi...
原创
2020-11-03 20:58:33 ·
117 阅读 ·
0 评论