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.
