We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
先把每个block的坐标全排列变成6个block。 然后将block按第一个坐标排序,再按顺序枚举,利用一个map存放第二个坐标为键的能取到的最高高度。 状态转移方程:f(x) = max{f(i) + height[x], 0 < i < x}