- 博客(1)
- 收藏
- 关注
原创 HDU 4911 逆序数对
Tag: #hdu4911 #逆序数对题目(原题目:HDU 4911)bobo has a sequence a 1,a 2,…,a n. He is allowed to swap two adjacent(相邻) numbers for no more than k times.Find the minimum number of inversions after his swaps....
2019-11-29 16:46:27
253
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人