Rank permutation with increasing runs and constraints

Question

I want to rank permutations which have serveral increasing runs. A increasing run is a sequence of permutation elements in the following form perm[i] < perm[i+1]