you dont need that much to do this problem modify merge method in mergesort to calculate the sum in nlgn think about it it's quite easy
you must have heard of Count Inversion problem , this is similar to that problem On Tue, Apr 10, 2012 at 6:49 AM, bharath kannan <[email protected]>wrote: > I dont know if it can be solved in O(n). But O(nlogn) can be done using > BIT. Refer topcoder tutorial for Binary indexed trees. > > > On Mon, Apr 9, 2012 at 10:56 AM, tarun chabarwal <[email protected]>wrote: > >> how should i approach this problem.... >> https://www.spoj.pl/problems/DCEPC206/ >> can it be solved in O(n)..? >> >> -- >> You received this message because you are subscribed to the Google Groups >> "Algorithm Geeks" group. >> To post to this group, send email to [email protected]. >> To unsubscribe from this group, send email to >> [email protected]. >> 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 [email protected]. > To unsubscribe from this group, send email to > [email protected]. > For more options, visit this group at > http://groups.google.com/group/algogeeks?hl=en. > -- Regards Anurag Gupta III Year Computer Engineering Delhi Technological University (Formerly Delhi College of Engineering) -- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to [email protected]. To unsubscribe from this group, send email to [email protected]. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
