PTA 1067 Sort with Swap(0, i) （25 分)(思维)
摘要：
传送门：点我 Given any permutation of the numbers {0, 1, 2,..., N−1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operat 阅读全文
posted @ 2019-03-13 17:12 Esquecer 阅读(213) 评论(0) 推荐(0) 编辑
