This question has already been discussed. My solution goes like this Constructing trees... Box 1 dim: 7,8,9 Make it as root1. The root also has a counter associated with it. Now count1=1. Then Box 2 dim: 5,6,8 < 7,8,9. Make it as a left child of root1 and count1=2. Box 3 dim: 5,8,7 doesn't fit in any and hence make it a tree by itself i.e root2 its count2=1. Box 4 dim: 4,4,4 it can be made as the left child of box 2 as well as Box 3. count1=3, count2=2. Print the reverse inorder traversal of the highest counter valued tree.
On Tue, Jul 20, 2010 at 8:28 PM, Ashish Goel <ashg...@gmail.com> wrote: > kindly give an example > > Best Regards > Ashish Goel > "Think positive and find fuel in failure" > +919985813081 > +919966006652 > > > > On Tue, Jul 20, 2010 at 8:04 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.com<algogeeks%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<algogeeks%2bunsubscr...@googlegroups.com> >> . >> For more options, visit this group at >> http://groups.google.com/group/algogeeks?hl=en. >> > > -- > 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<algogeeks%2bunsubscr...@googlegroups.com> > . > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- 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.
