CodeForces 686B 冒泡排序
来源:互联网 发布:c语言竖线 编辑:程序博客网 时间:2024/06/05 09:58
题目的链接如下:
http://codeforces.com/problemset/problem/686/B
B. Little Robber Girl’s Zoo
time limit per test2 seconds
memory limit per test256 megabytes
inputstandard input
outputstandard output
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.
Examples
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
2 5
3 4
1 4
1 4
Note
Note that you don’t have to minimize the number of operations. Any solution that performs at most 20 000 operations is allowed.
这个题就很尴尬了,因为它的样例输出和最后的答案是不相同的,别问我为什么,我也不知道。代码如下:
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>#include <string>1#include <algorithm>using namespace std;int a[110];int main(){ int n; cin >> n ; for(int i=1;i<=n;i++) cin >> a[i]; for(int i=0;i<n;i++){ for(int j=2;j<=n;j++){ if(a[j-1]>a[j]){ swap(a[j-1],a[j]);//如果两个数前者大于后者,就交换,然后输出它是第几个元素。 cout << j-1 <<" " << j << endl ; } } } return 0 ;}
- CodeForces 686B 冒泡排序
- CodeForces 686B Little Robber Girl's Zoo(模拟冒泡排序)
- codeforces#321 B(排序+二分)
- 数组排序(冒泡法 b)
- CodeForces 686 B
- CodeForces - 686B
- Codeforces 383B Volcanoes(排序+检索)
- Codeforces 412B Network Configuration (排序)
- Codeforces 101B Buses 排序+树状数组
- codeforces 479B. Towers C - Exams【排序】
- Codeforces 3B.Lorry(贪心,排序)
- CodeForces 151 B 结构体排序。
- CodeForces 151 B 结构体排序。
- 【CodeForces 651B】Beautiful Paintings 排序+贪心
- CodeForces 24B F1 Champions(排序)
- Codeforces 383B Volcanoes(排序+检索)
- 【CodeForces 572B】Order Book(排序)
- hdu-1040-As Easy As A+B(冒泡排序)
- 演示MP3的复制。通过IO流缓冲区。
- 【转载】逃离adapter的地狱-针对多个View type的组合实现方案
- Kth Smallest Element in a BST
- Map获取键值的几种遍历方法
- 通过火车票还原身份证
- CodeForces 686B 冒泡排序
- Codeforces700A As Fast As Possible 数学推理
- Python异常处理机制
- 欧拉函数求法与应用
- Servlet整合Log4j日志记录
- HDU Problem 1052 Tian Ji -- The Horse Racing 【贪心】
- TCP三次握手和劫持原理与实例
- Hibernate学习笔记----映射继承关系
- sql关键语句详解