you can solve this question with DP programming this question is the same as box stacking problem just instead of height you should maximize the number the order will be o(n^2)
On Thu, Jan 6, 2011 at 11:31 PM, Decipher <ankurseth...@gmail.com> wrote: > You are given a lot of cuboid boxes with different length, breadth and > height. You need to find the maximum subset which can fit into each > other. > For example: > If Box A has LBH as 7 8 9 > If Box B has LBH as 5 6 8 > If Box C has LBH as 5 8 7 > If Box D has LBH as 4 4 4 > then answer is A,B,D > A box can fit into another only and only if all dimensions of that is > less than the bigger box. Also 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. > > -- Innovation Isn’t ‘Creativity,’ It’s a Discipline You Manage -- 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.
