Question
Given two integers
n
andk
, find how many different arrays consist of numbers from1
ton
such that there are exactlyk
inverse pairs.We define an inverse pair as following: For
Given two integers
n
andk
, find how many different arrays consist of numbers from1
ton
such that there are exactlyk
inverse pairs.We define an inverse pair as following: For