tag:blogger.com,1999:blog-9126683650343594008.post354141335621575786..comments2016-09-12T19:49:57.647-07:00Comments on Eureka!!: Binary Indexed Treeashish panthttps://plus.google.com/108145774191294177405noreply@blogger.comBlogger7125tag:blogger.com,1999:blog-9126683650343594008.post-40553679122712323352015-01-24T11:23:44.130-08:002015-01-24T11:23:44.130-08:00Lite man! You are a genius.. U can do it urslf :pLite man! You are a genius.. U can do it urslf :ppranjal ranjanhttp://www.blogger.com/profile/11516144722620462969noreply@blogger.comtag:blogger.com,1999:blog-9126683650343594008.post-78442153115166783772014-10-26T10:00:07.123-07:002014-10-26T10:00:07.123-07:00How to implement the function to find the maximum ...How to implement the function to find the maximum or minimum of a range of numbers in as a query?Bipin Baburajhttp://www.blogger.com/profile/17078014666469053258noreply@blogger.comtag:blogger.com,1999:blog-9126683650343594008.post-62968634818043924572013-12-09T23:12:59.951-08:002013-12-09T23:12:59.951-08:00I will be very helpfull if u tell us how we should...I will be very helpfull if u tell us how we should create the tree given we have an array of <br />frequencies.Himanshu Tomarhttp://www.blogger.com/profile/02084185440108543630noreply@blogger.comtag:blogger.com,1999:blog-9126683650343594008.post-89471602426634502382012-12-20T09:19:38.584-08:002012-12-20T09:19:38.584-08:00thank you so much for this tutorials really helpfu...thank you so much for this tutorials really helpfull :)!!!!!!!!!!<br /><br />would you do a tutorial about maxflow, mincost maxflow, mincut, and convex hull? :D!!!!!Rodolfo JosÃ© Miquilarena Gonazalezhttp://www.blogger.com/profile/17210344098781669775noreply@blogger.comtag:blogger.com,1999:blog-9126683650343594008.post-37314746714984635412012-10-02T09:18:50.398-07:002012-10-02T09:18:50.398-07:00Well we could of-course do the partial sums for ge...Well we could of-course do the partial sums for getting sums in a range. However if one were to update the elements of the array then I think the update process would have higher complexity. As mentioned in the problem statement, BIT is useful to do both queries and updates at lower complexity and not just queries or updates.<br /><br />As for the RMQ on an array of data with updates, I would also like to know how u would do it using a BIT.ashish panthttp://www.blogger.com/profile/00334758887114196596noreply@blogger.comtag:blogger.com,1999:blog-9126683650343594008.post-74236740432590257242012-09-21T13:52:33.711-07:002012-09-21T13:52:33.711-07:00Let's see if I got this:
For the problem given...Let's see if I got this:<br />For the problem given, a.k.a summing over a given range, this is not a good solution, since we can do O(1) if we simply use partial sums in a temp array (sum(i,j) = partialSum(j) - partialSum(i)).<br />Nevertheless, this structure is good when asking different questions about a range (e.g. maximum value in a given range / RMQ ).<br />My point is - the given example (taken from topCoder) should have been chosen differently.Assaf Selahttp://www.blogger.com/profile/12094673143241391582noreply@blogger.comtag:blogger.com,1999:blog-9126683650343594008.post-84596217291543814652012-04-13T04:51:00.683-07:002012-04-13T04:51:00.683-07:00really useful in lots of spoj problems...thanks!!really useful in lots of spoj problems...thanks!!kavish dwivedihttp://www.blogger.com/profile/04362174610809548554noreply@blogger.com