Maximum Sum of a non decreasing sub-sequence in an array using fenwick tree or BIT

Maximum Sum of a non decreasing sub-sequence in an array using fenwick
tree or BIT

References

Reference NO 1

http://stackoverflow.com/questions/15193469/maximum-sum-of-a-non-decreasing-sub-sequence-in-an-array-using-fenwick-tree-or-b

Reference NO 2

http://stackoverflow.com/tags/fenwick-tree/hot

Reference NO 3

http://stackoverflow.com/questions/15938762/maximum-product-ascending-sub-sequence

Reference NO 4

http://stackoverflow.com/questions/18065238/how-to-do-a-range-update-in-binary-indexed-tree-or-fenwick-tree

Reference NO 5

http://stackoverflow.com/questions/9010284/largest-sum-of-non-decreasing-up-sequence

Reference NO 6

#EANF#

Reference NO 7

#EANF#

Reference NO 8

#EANF#