×

Range Update in BIT

 1 Is it possible to update a range in Binary Indexed Tree...?? I want this to solve the http://www.codechef.com/problems/FLIPCOIN problem using Binary Indexed Tree(BIT). asked 06 Feb '13, 20:25 175●7●9●16 accept rate: 9%

 3 I've explained range updates with BIT and provided implementation here: http://kartikkukreja.wordpress.com/2013/12/02/range-updates-with-bit-fenwick-tree/ answered 02 Dec '13, 22:26 106●4 accept rate: 16% Really amazing post!! :D It helped me understanding some things in a pratical way which I've only read about! Thanks! (04 Dec '13, 06:23) kuruma3★ hey ..did studied ur post bt could not understand "Why we are not doing :- update(a,v) update(b+1,-v) for the update part and query(b)-query(a-1) for the sum part ..whats wrong in that part???" (04 Apr '14, 09:40) wonder2★
 0 answered 02 Jul '13, 18:30 1.1k●5●10●21 accept rate: 10%
 0 another goes here.. http://zobayer.blogspot.in/2013/11/various-usage-of-bit.html answered 13 Dec '13, 03:23 211●3●9●19 accept rate: 0%
 0 I have spent many days to understand range update, wrote simple explanation with example here: https://github.com/manoharreddyporeddy/AdvancedDataStructuresAndAlgorithms/blob/master/BIT_fenwick_tree_explanation.md answered 05 Nov '17, 07:37 0★pgmreddy 1 accept rate: 0%
 toggle preview community wiki:
Preview

By Email:

Markdown Basics

• *italic* or _italic_
• **bold** or __bold__
• image?![alt text](/path/img.jpg "title")
• numbered list: 1. Foo 2. Bar
• to add a line break simply add two spaces to where you would like the new line to be.
• basic HTML tags are also supported
• mathemetical formulas in Latex between \$ symbol

Question tags:

×672
×162
×53
×7

question asked: 06 Feb '13, 20:25

question was seen: 11,590 times

last updated: 05 Nov '17, 07:37