How to do a range update in Binary Indexed Tree or Fenwick Tree?

Question

I am trying to solve this problem in UVA with Binary Indexed Tree:

Problem H
Ahoy, Pirates!

Input: Standard Input
Output: Standard Output


In the ancient pirate         


        

Answer 1

A BIT can be operated in one of 3 modes:

• Point updates and range queries
• Range updates and point queries
• Range updates and range queries

I've explained range updates with BIT and provided implementation here: http://kartikkukreja.wordpress.com/2013/12/02/range-updates-with-bit-fenwick-tree/