Count number of arrays with k-inversions

Правка en1, от 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.

История

 
 
 
 
Правки
 
 
  Rev. Язык Кто Когда Δ Комментарий
en1 Английский aakarshmadhavan 2018-08-09 07:59:46 288 Initial revision (published)