直角坐标平面上有一长为W、高为H的大矩形。该大矩形被划分为N个不相交的小矩形，且这些小矩形恰好拼成该大矩形。给定K，求一个面积最大的矩形R,使得R由部分给定的小矩形恰好拼成，且这些小矩形的数目不超过K个。-A length of W, height H of the large rectangular Cartesian coordinate plane. The large rectangle is divided into N disjoint small rectangle, and these small rectangle exactly makes up the large rectangle. Given K, seeking a largest rectangle R, so R by a small portion of a given rectangle exactly spell, and the number of these small rectangle does not exceed the K.