Problem No- 1085 (All Possible Increasing Subsequences ) This is an interesting data structure based problem.It can be solved by segment tree or Binary Index Tree(BIT) . Here numbers can be both negative and positive. If we want to solve with BIT then we need to compressed the array. After that we can easily solve this problem using BIT. Here is the solution (BIT)- My Solution