@Romil : what u r talking about is case of substring, check out the problem again. In substrings we need continuously, not in subsequences.
and I have said longest increasing subsequence, not longest common subsequence On 8/17/11, Shiv Kumar Malik <skm1...@gmail.com> wrote: > i think this can be solved by dynamic programming. > this is very similar to the knapsack problem. > > 1. We have to maximize profit by increasing the length of array. > 2. principle of optimality also holds here. > > considering the points solution ca be visualized easily. > > -- > 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. > > -- Sanjay Kumar B.Tech Final Year Department of Computer Engineering National Institute of Technology Kurukshetra Kurukshetra - 136119 Haryana, India Contact: +91-8053566286, +91-9729683720 -- 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.
