title: Maximum Sum of a non decreasing sub-sequence in an array using fenwick tree or BIT
body: <p>How can we find the maximum sum of a non-decreasing sub-sequence in an array using fenwick tree? For example we have 1 4 4 2 2 3 3 1, here the maximum sum of a non-decreasing sub-sequence is 11 (1 2 2 3 3).</p>