CodeForces 1269 D.Domino for Young (交叉染色)

D.Domino for Young You are given a Young diagram.c++ Given diagram is a histogram with n columns of lengths a1,a2,…,an (a1≥a2≥…≥an≥1). Young diagram for a=[3,2,2,2,1]. Your goal is to find the largest

>>阅读原文<<