CodeForces - 686B

最新推荐文章于 2024-07-06 22:40:01 发布

xzt1996

最新推荐文章于 2024-07-06 22:40:01 发布

阅读量529

点赞数

本文链接：https://blog.csdn.net/xzt1996/article/details/51835612

版权

http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=406129

CodeForces - 686B

Little Robber Girl's Zoo

Time Limit: 2000MS

Memory Limit: 262144KB

64bit IO Format: %I64d & %I64u

Submit Status

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 a₁, a₂, ..., a_n (1 ≤ a_i ≤ 10⁹), where a_i 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 l_i and r_i (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 20 000.

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

Sample Input

Input

4
2 1 4 3

Output

1 4

Input

7
36 28 57 39 66 69 68

Output

1 4
6 7

Input

5
1 2 1 2 1

Output

Source

Codeforces Round #359 (Div. 2)

题意:按动物身高排序.

最大操作次数20000,因此即使每次操作是只操作相邻的两个也不会超

此题巩固冒泡排序及其应用

#include<iostream>
#include<iomanip>
#include<algorithm>
#include<istream>
#include<ostream>
#include<cstring>
#include<cstdio>
using namespace std;
typedef long long ll;
int a[100+5];
int main(){
    int n;
    while(~scanf("%d",&n)){
        for(int i=0;i<n;i++)scanf("%d",&a[i]);
        for(int i=1;i<n;i++)
        for(int j=0;j<n-1;j++){
            int u=j+1;
            if(a[j]>a[u]){
                swap(a[j],a[u]);
                cout<<j+1<<" "<<u+1<<endl;
            }
        }
    }
    return 0;
}