@nishaath you are correct. On Fri, Jan 7, 2011 at 9:03 PM, nishaanth <nishaant...@gmail.com> wrote:
> @anand...A small correction, in that longest increasing subsequence > algorithm we also should make sure that the first two dimensions are also > proper. Because sorting two dimensions based on area doesnt mean they fit. > > On Sat, Jan 8, 2011 at 4:40 AM, Anand <anandut2...@gmail.com> wrote: > >> This is absolutely longest increasing sub-sequence problem. >> >> Since rotation is not possible. For the given L and B values calculate the >> base area L * B for all the given values and sort it. From this sorted array >> calculate the longest increasing sub-sequence of H. >> >> >> The Out put sequence gives the answer. >> >> >> >> On Fri, Jan 7, 2011 at 11:46 AM, Decipher <ankurseth...@gmail.com> wrote: >> >>> I think this is a modification of longest increasing subsequence >>> problem . First , sort by length then find the longest increasing >>> subsequence by width. Now, in this solution find longest increasing >>> subsequence by height . This would be the answer to this question. >>> >>> -- >>> 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. >>> >>> >> -- >> 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. >> > > > > -- > S.Nishaanth, > Computer Science and engineering, > IIT Madras. > > -- > 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. > -- 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.
