@Devendra sorted sequence of boxes are :
box1 LBH - 7 8 9 box2 LBH - 6 7 8 box3 LBH - 3 7 2 Now longest decreasing sub-sequence of above will have all the three boxes as box1 >= box2 >= box3 ( box[i] >= box[j] if all L,B,H of box[i] are >= that of box[j] respectively .) so ans = ( 3 ) all boxes .... On Tue, Jul 20, 2010 at 8:34 AM, Devendra Pratap Singh < dpsingh.ii...@gmail.com> wrote: > @siddarth > > can u explain ur algo for > > box1 LBH - 7 8 9 > box2 LBH - 6 7 8 > box3 LBH - 3 7 2 > > -- > 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. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
