Given an array of N integers , how can we find the number of all increasing subsequences in O -LRB- N * Log N -RRB- time ?
Given an array of N integers , how can we find out the number of increasing subsequences of length 2,3,4 , ... , k -LRB- K < = N -RRB- efficiently ?