UV 437-The Tower of Babylon (longest Dag path)

From http://blog.csdn.net/shuangde800

Question: Click to open the link

Theme

There are n kinds of bricks with the length, width, and height of X, Y, and Z, each of which has countless.

Bricks can be built in different positions.

Brick A can be built on Brick B in some way. If and only when the bottom of a is longer and wider than B.

How high can I create?

Ideas

For an X, Y, and Z Brick, it can be placed in three middle positions.

(The first two are on the ground, and the last one is high)

X, Y, Z

X, Z, y

Y, Z, X

Record each posture into a brick with 3 * n fixed positions.

Create a graph. g [I] [J] = true indicates that the brick I can be built on the brick J, and vice versa.

Then, find the longest path on the Dag.

Code