{"trustable":false,"sections":[{"title":"","value":{"format":"MD","content":"有n(n\u003c\u003d30) 种砖块,已知三条边长,每种都有无穷多个。要求选一些立方体摞成一根尽量高的柱子(每个砖块可以自行选择一条边作为高),使得每个砖块的底面长宽分别严格小于它下方砖块的底面长宽,求塔的最大高度。"}},{"title":"","value":{"format":"MD","content":""}}]}