make a balanced bst which also has the size of subtree at each node start from ar[n-1] and insert each element and see what is it's rank in BST for finding the rank when inserting each time you pick the right subtree add size of left subtree to rank O(nlogn)
-- You received this message because you are subscribed to the Google Groups "Algorithm Geeks" group. To post to this group, send email to algoge...@googlegroups.com. To unsubscribe from this group, send email to algogeeks+unsubscr...@googlegroups.com. For more options, visit this group at http://groups.google.com/group/algogeeks?hl=en.
