can a descriptive explaination be provided to this, unfortunately not clear the idea of for loop
Best Regards Ashish Goel "Think positive and find fuel in failure" +919985813081 +919966006652 On Wed, May 25, 2011 at 4:50 PM, ankit sambyal <ankitsamb...@gmail.com>wrote: > thanks anshu, i m working with segment trees now. Ur algo seems convincing > to me. > nice solution !! > > > Ankit > > > > > On Wed, May 25, 2011 at 1:54 AM, anshu mishra > <anshumishra6...@gmail.com>wrote: > >> two thing i have forgot do; >> >> that is at every iteration >> >> rem--; >> last = D[i-1]; >> >> -- >> 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.
