Roset1ng的博客

·································边长为min(n, m) - 1的正方形有(min(n, m) - 2) * (min(n, m) - 2)个。··································边长为min(n, m) - 2的正方形有(min(n, m) - 3) * (min(n, m) - 3)个。··································以此类推，可以得出正方形的个数。(因为得出总个数比单独求长方形要简洁)

设有有2n（n

这道题很难想出来用二分法去做，并且不能从模拟的层面下手，解法是通过二分计算每条绳子的可切割的数量是否满足m，如果不满足m，去掉左半边（说明还不是最长的）。