CF1269D. Domino for Young （贪心）

You are given a Young diagram.web Given diagram is a histogram with 𝑛 columns of lengths 𝑎1,𝑎2,…,𝑎𝑛 (𝑎1≥𝑎2≥…≥𝑎𝑛≥1).app Young diagram for 𝑎=[3,2,2,2,1]. Your goal is to find the largest numbe

>>阅读原文<<