For the first note, why is the answer 1,2,4
Shouldn't it be minimum L,B,H of all the boxes?
So, shouldn't the answer be 4,4,4
And strictly speaking, side 4 wont go inside a box with side 4.
So, answer should be minL-1, minH-1, minW-1 i.e. 3,3,3 in the above
case.
On Jul 20, 7:34 am, siddharth shankar siddharth.shanka...@gmail.com
wrote:
step :
1. Sorting LBH in decreasing order first on L than on B and than on H
.
2. Now find longest decreasing sub-sequence of array of structures(LBH) .
correct me if I m wrong !!!
On Sun, Jul 18, 2010 at 11:44 PM, amit amitjaspal...@gmail.com wrote:
Given a lot of cuboid boxes with different length, breadth and height.
We need to find the maximum subset which can fit into each other.
For example:
If Box 1 has LBH as 7 8 9
If Box 2 has LBH as 5 6 8
If Box 3 has LBH as 5 8 7
If Box 4 has LBH as 4 4 4
then answer is 1,2,4
A box can fit into another only and only if all dimensions of that is
less than the bigger box.Rotation of boxes is not possible.
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.comalgogeeks%2bunsubscr...@googlegroups
.com
.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
--
siddharth shankar
--
You received this message because you are subscribed to the Google Groups
Algorithm Geeks group.
To post to this group, send email to algoge...@googlegroups.com.
To unsubscribe from this group, send email to
algogeeks+unsubscr...@googlegroups.com.
For more options, visit this group at
http://groups.google.com/group/algogeeks?hl=en.
