This seems longest increasing subsequence problem to me.. Thanks, Anurag
On Mon, Apr 25, 2011 at 9:31 PM, snehal jain <learner....@gmail.com> wrote: > few eg > input > 4 7 12 3 1 > output 4 7 12 > cost: 4 by removing 3 n 1 > > eg 2 > > 6 3 5 7 12 4 > o/p 3 3 5 7 12 > cost 7 by decrementing 6 by 3 and removing 4 > > eg 3 > > 4 9 8 7 8 > o/p 4 7 7 7 8 > cost 3 by decrementing 9 n 8 > > i hope its clear now.. > > > On Mon, Apr 25, 2011 at 9:16 PM, hary rathor <harry.rat...@gmail.com>wrote: > >> just tell me >> >> what is input and what will the output. atleast 3 example >> >> -- >> 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. > -- 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.
