i think it is similar to finding max in a list O(n) or sorting algorithm O(n log n)
-- Prashant Kulkarni On Tue, Sep 28, 2010 at 11:33 PM, Rahul Singal <[email protected]>wrote: > A possible solution i can think is create a directed graph where each > vertex is a envelope and edges are from a bigger envelope to smaller > envelope ( one which can fit in bigger envelope ) . Now the problem is > reduce to finding longest path in the graph . > > Regards > Rahul > > -- > You received this message because you are subscribed to the Google Groups > "Algorithm Geeks" group. > To post to this group, send email to [email protected]. > To unsubscribe from this group, send email to > [email protected]<algogeeks%[email protected]> > . > 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 [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
