2015年8月9日
015 HUAS Summer Contest#3~A
摘要： Descriptionbobo has a sequence a1,a2,…,an. He is allowed to swap twoadjacentnumbers for no more than k times.Find the minimum number of inversions aft... 阅读全文
posted @ 2015-08-09 21:40 简约。 阅读(172) 评论(0) 推荐(0) 编辑