Codeforces Round #359 (Div. 2) B. Little Robber Girl's Zoo
2016-06-24 09:20
375 查看
原题链接
B. Little Robber Girl's Zoo
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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
thatr - l + 1 is even. After that animals that occupy positions between l and r inclusively
are rearranged as follows: the animal at position lswaps 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
output
input
output
input
output
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 <bits/stdc++.h>
#define maxn 105
using namespace std;
typedef long long ll;
int num[maxn];
int main(){
// freopen("in.txt", "r", stdin);
int n;
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%d", num+i);
for(int i = n; i > 1; i--)
for(int j = 1; j < i; j++){
if(num[j] > num[j+1]){
swap(num[j], num[j+1]);
printf("%d %d\n", j, j+1);
}
}
return 0;
}
B. Little Robber Girl's Zoo
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard 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
thatr - l + 1 is even. After that animals that occupy positions between l and r inclusively
are rearranged as follows: the animal at position lswaps 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 46 7
input
5 1 2 1 2 1
output
2 5
3 4
1 41 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 <bits/stdc++.h>
#define maxn 105
using namespace std;
typedef long long ll;
int num[maxn];
int main(){
// freopen("in.txt", "r", stdin);
int n;
scanf("%d", &n);
for(int i = 1; i <= n; i++)
scanf("%d", num+i);
for(int i = n; i > 1; i--)
for(int j = 1; j < i; j++){
if(num[j] > num[j+1]){
swap(num[j], num[j+1]);
printf("%d %d\n", j, j+1);
}
}
return 0;
}
相关文章推荐
- Hibernate一对一、一对多、多对多注解映射配置
- SQL 2014 AlwaysOn 搭建
- 前端面试题之Html和CSS
- (python)创建一个可以比较的自定义类
- 初步集成ShareSDK 简单的集成
- messager.confirm 弹出后 让光标在取消按钮上
- Javascript的Map对象
- Swift - 协议(protocol)
- 前端面试题 之 JavaScript
- ORA-12518: TNS: 监听程序无法分发客户机连接
- Python函数
- wince 贪吃蛇
- JS处理JSON和数组
- English - even though和even if用法解析
- html meta标签作用
- 从vSphere 5.5升级到6之3-使用VUM升级ESXi
- 太用力的人跑不远
- mybatis中parameterType可以写的别名
- STM32F0 ADC学习
- Pycharm快捷键