23 人解决，34 人已尝试。
25 份提交通过，共有 86 份提交。
5.1 EMB 奖励。
单点时限: 2.0 sec
内存限制: 256 MB
After each commission to install a shrubbery, Roger the Shrubber has to transport many empty planting boxes with a drawn cart. In this instance, a planting box is a wooden box with one open side.
Given a set of n planting boxes, compute the largest number of boxes that can be nested. Specifically, report the number of the largest subset of boxes which may be nested such that the smallest box of the subset fits within the second smallest, the second smallest of the subset fits within the third smallest, the third smallest of the subset fits within the fourth smallest, and so forth.
A box i (bi) fits into box j (bj) if there exists some rotation of bi such that each dimension of bi is less than the corresponding dimension of bj. Any box can be rotated to nest inside another box.
The input will consist of an unspecified number of box sets. Each set will begin with a line containing n, 0 <= n <= 500, the number of boxes in the set. Each box will be described on its own line by three positive integers representing length, width and height (Each value will not exceed 1000). The first two numbers of each box description will be followed by a space, the letter ‘x’, and a space. The end of input occurs when n = -1.
For each set of boxes, print a line containing the largest number of boxes that can be selected from the original set to form a fully nesting subset of boxes.
5 145 x 472 x 812 827 x 133 x 549 381 x 371 x 900 271 x 389 x 128 718 x 217 x 491 4 432 x 123 x 139 942 x 844 x 783 481 x 487 x 577 677 x 581 x 701 -1
2 4
23 人解决，34 人已尝试。
25 份提交通过，共有 86 份提交。
5.1 EMB 奖励。
创建: 17 年，3 月前.
修改: 7 年，2 月前.
最后提交: 3 年，9 月前.
来源: N/A