its a LIS problem. need to think for n-dimension...
On 8/26/12, Ravi Ranjan <ravi.cool2...@gmail.com> wrote: > You are given many slabs each with a length and a breadth. A slab i can be > put on slab j if both dimensions of i are less than that of j. In this > similar manner, you can keep on putting slabs on each other. Find the > maximum stack possible which you can create out of the given slabs > > and for general n-dimesions > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to algogeeks@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. > > -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algogeeks@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.
