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