CF686B.Little Robber Girl's Zoo
普及/提高-
通过率:0%
AC君温馨提醒
该题目为【codeforces】题库的题目,您提交的代码将被提交至codeforces进行远程评测,并由ACGO抓取测评结果后进行展示。由于远程测评的测评机由其他平台提供,我们无法保证该服务的稳定性,若提交后无反应,请等待一段时间后再进行重试。
题目描述
Little Robber Girl likes to scare animals in her zoo for fun. She decided to arrange the animals in a row in the order of non-decreasing height. However, the animals were so scared that they couldn't stay in the right places.
The robber girl was angry at first, but then she decided to arrange the animals herself. She repeatedly names numbers l and r such that r−l+1 is even. After that animals that occupy positions between l and r inclusively are rearranged as follows: the animal at position l swaps places with the animal at position l+1 , the animal l+2 swaps with the animal l+3 , ..., finally, the animal at position r−1 swaps with the animal r .
Help the robber girl to arrange the animals in the order of non-decreasing height. You should name at most 20000 segments, since otherwise the robber girl will become bored and will start scaring the animals again.
输入格式
The first line contains a single integer n ( 1<=n<=100 ) — number of animals in the robber girl's zoo.
The second line contains n space-separated integers a1,a2,...,an ( 1<=ai<=109 ), where ai is the height of the animal occupying the i -th place.
输出格式
Print the sequence of operations that will rearrange the animals by non-decreasing height.
The output should contain several lines, i -th of the lines should contain two space-separated integers li and ri ( 1<=l_{i}<r_{i}<=n ) — descriptions of segments the robber girl should name. The segments should be described in the order the operations are performed.
The number of operations should not exceed 20000 .
If the animals are arranged correctly from the start, you are allowed to output nothing.
输入输出样例
输入#1
4 2 1 4 3
输出#1
1 4
输入#2
7 36 28 57 39 66 69 68
输出#2
1 4 6 7
输入#3
5 1 2 1 2 1
输出#3
2 5 3 4 1 4 1 4
说明/提示
Note that you don't have to minimize the number of operations. Any solution that performs at most 20000 operations is allowed.