POJ 3636 Nested Dolls Dynamic Update table for two-point lookup

Test instructions

Give n a toy, each with a property w,h. If W1<w2 and h1

Analysis:

W Ascending, W is the same when the H descending sort can be greedy, here using the Dynamic Maintenance table of the binary algorithm, the table dynamically maintained the maximum value of h in each pile of toys (so W is the same as h to descending). I started off with a topology diagram and thought about the graph algorithm. Did not think directly can be greedy, can not have the thinking formula AH ~ ~

Code:

POJ 3636 Nested Dolls Dynamic Update table for two-point lookup