All Questions
1 question
4
votes
1
answer
174
views
Counting increasing subsequences with a "hacker's" Binary Index Tree
This is an \$O(n \sqrt n)\$ solution to the the following problem:
Given a sequence, compute the number of non-empty increasing subsequences
The algorithm is to compute ...
