摘要: Given two integers n and k, find how many different arrays consist of numbers from 1 to n such that there are exactly k inverse pairs. We define an in 阅读全文
posted @ 2017-06-26 14:03 安新 阅读(315) 评论(0) 推荐(0) 编辑