@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
@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 ema
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 sha
