hdu 4911 Inversion (归并排序)
Problem Description
bobo has a sequence a1,a2,…,an. He is allowed to swap two adjacent numbers for no more than k times.
Find the minimum number of inversions after his swaps.
Note: The numbe
原创
2017-03-11 21:34:09 ·
233 阅读 ·
0 评论