Count number of arrays with k-inversions

Revision en1, by aakarshmadhavan, 2018-08-09 07:59:46

I'm trying to come up with a recursive solution for this problem but I haven't been able to so far. Any advice/pointers here?

I tried 0-1 knapsack style but there is an issue with backtracking the array.

History

 
 
 
 
Revisions
 
 
  Rev. Lang. By When Δ Comment
en1 English aakarshmadhavan 2018-08-09 07:59:46 288 Initial revision (published)