CodeForces - 686B
来源:互联网 发布:百度地图编辑软件 编辑:程序博客网 时间:2024/06/04 18:26
http://acm.hust.edu.cn/vjudge/problem/viewProblem.action?id=406129
CodeForces - 686B
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
42 1 4 3
1 4
736 28 57 39 66 69 68
1 46 7
51 2 1 2 1
2 53 41 41 4
Source
题意:按动物身高排序.
最大操作次数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;}
- CodeForces 686 B
- CodeForces - 686B
- CodeForces 686B 冒泡排序
- codeforces B
- codeforces B
- codeforces B
- codeforces B
- CodeForces 626B CodeForces 626B【暴力】
- CodeForces 841B (B) 博弈
- codeforces 134B
- codeforces#98 b
- codeforces 105 div2 B
- Codeforces 166B - Polygons
- codeforces B. Coins
- codeforces----193B Xor
- codeforces----208B Solitaire
- Codeforces 1B - Spreadsheet
- codeforces 214B Hometask
- 创建对象的几种方法
- SpringMVC常用注解,返回方式,路径匹配形式,验证【转】
- 设计模式--模板方法模式
- classpath路径【转】
- 虚幻4 dump 材质编辑器编译出来的 shader的hlsl文件
- CodeForces - 686B
- 【杭电oj】5246 - 超级赛亚ACMer(二分 & 贪心 & STL)
- Android学习第3天,test、sqlite、listview、dialog
- 华为机试---学英语
- Java读写二进制文件操作
- 26. Remove Duplicates from Sorted Array
- 入夜。
- 文件上传之servlet3.0实现
- linux内核数据结构之kfifo