@Sanjay: In the longest common subsequence we have the continuous elements but here he has placed no restriction on that..
On Wed, Aug 17, 2011 at 9:06 PM, Raghavan <its...@gmail.com> wrote: > @sanjay: > > Thats cool > > > On Wed, Aug 17, 2011 at 9:02 PM, Sanjay Rajpal <srn...@gmail.com> wrote: > >> I think it is similar to longest increasing subsequence problem . >> Try the following link : >> http://en.wikipedia.org/wiki/Longest_increasing_subsequence >> >> Sanjay Kumar >> B.Tech Final Year >> Department of Computer Engineering >> National Institute of Technology Kurukshetra >> Kurukshetra - 136119 >> Haryana, India >> >> >> >> >> On Wed, Aug 17, 2011 at 8:26 AM, Raghavan <its...@gmail.com> wrote: >> >>> >>> >>> Given an unsorted array (A), find the max size of set in which the >>> numbers should be in the incremental order. >>> >>> >>> For example: A = [7,* 2, 3*, 1, *5, 8, 9*, 6] >>> >>> >>> The possible set with max numbers (in increment order) is {2, 3, 5, 8, 9} >>> and the result is: 5. >>> >>> Note: >>> 1. The final set can begin at any index. >>> 2. It can skip any numbers which comes in between the array (here we >>> skipped {7, 1, 6}). >>> >>> how to do this? >>> >>> -- >>> Thanks and Regards, >>> Raghavan KL >>> >>> -- >>> 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. >> > > > > -- > Thanks and Regards, > Raghavan KL > > -- > 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. > -- Romil -- 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.
