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.
