HDU 2689 sort it(树状数组 逆序数)
摘要:
Problem Description You want to processe a sequence of n distinct integers by swapping two adjacent sequence elements until the sequence is sorted in 阅读全文
posted @ 2019-01-21 21:07 甜甜圈不懂巧克力的苦 阅读(121) 评论(0) 推荐(0) 编辑