| 2 | using namespace std; |
| 3 | |
| 4 | int getSum(int BITree[], int index) |
| 5 | { |
| 6 | int sum = 0; |
| 7 | index = index + 1; |
| 8 | while (index>0) |
| 9 | { |
| 10 | sum += BITree[index]; |
| 11 | index -= index & (-index); |
| 12 | } |
| 13 | return sum; |
| 14 | } |
| 15 | |
| 16 | void updateBIT(int BITree[], int n, int index, int val) |
| 17 | { |