Can anyone help me to solve this, please?↵
↵
Find the number of different permutations of length n such that the number of indices i (1 <= i <= n-1) where p[i] > p[i+1] is equal to K.↵
↵
UPD: 1 <= n <= 3000, 0 <= k < n.
↵
Find the number of different permutations of length n such that the number of indices i (1 <= i <= n-1) where p[i] > p[i+1] is equal to K.↵
↵
UPD: 1 <= n <= 3000, 0 <= k < n.



