Codeforces Round #359 (Div. 2) B. Little Robber Girl's Zoo 水题

B. Little Robber Girl's Zoo

题目连接：

http://www.codeforces.com/contest/686/problem/B

Description

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 20 000 segments, since otherwise the robber girl will become bored and will start scaring the animals again.

Input

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.

Output

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 ≤ li < ri ≤ 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 20 000.

If the animals are arranged correctly from the start, you are allowed to output nothing.

Sample Input

4
2 1 4 3

Sample Output

1 4

Hint

题意

给你n个数，你需要把它变成非递减的序列

你每次操作可以给定一个[L,R]区间，使得这个区间的数l和l+1交换，l+2和l+3交换。。。R和R-1交换

然后最多输出20000次，使得有序。

题解：

为什么这么麻烦呢？操作

我每次只操作两个数不就好了，然后就像冒泡排序那样去写就好了。。。

代码

#include<bits/stdc++.h>
using namespace std;
const int maxn = 105;
int a[maxn],n;
int main()
{
    scanf("%d",&n);
    for(int i=1;i<=n;i++)
        scanf("%d",&a[i]);
    for(int i=n;i>=1;i--){
        for(int j=1;j<i;j++){
            if(a[j]>a[j+1]){
                swap(a[j],a[j+1]);
                cout<<j<<" "<<j+1<<endl;
            }
        }
    }
}