← 返回题目

题库练习 SwapSort

← 上一题下一题 →

A9739 | $SwapSort$

时间限制1s

内存限制256MB

通过 / 提交0/0

题目描述

In this problem your goal is to sort an array consisting of $n$ integers in at most $n$ swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Swaps are performed consecutively, one after another. Note that in this problem you do not have to minimize the number of swaps — your task is to find any sequence that is no longer than $n$ .

输入格式

In this problem your goal is to sort an array consisting of $n$ integers in at most $n$ swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Swaps are performed consecutively, one after another. Note that in this problem you do not have to minimize the number of swaps — your task is to find any sequence that is no longer than $n$ .

输出格式

In this problem your goal is to sort an array consisting of $n$ integers in at most $n$ swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Swaps are performed consecutively, one after another. Note that in this problem you do not have to minimize the number of swaps — your task is to find any sequence that is no longer than $n$ .

输入输出样例

输入 #1

5
5 2 5 1 4

输出 #1

2
0 3
4 2

输入 #2

6
10 20 20 40 60 60

输出 #2

输入 #3

2
101 100

输出 #3

1
0 1

C++ 编辑器

输入

输出