A. SwapSort
来源:互联网 发布:淘宝助理怎么导入宝贝 编辑:程序博客网 时间:2024/06/07 00:28
In this problem your goal is to sort an array consisting of n integers in at most n swaps. For the given array find the sequence of swaps that makes the array sorted in the non-descending order. Swaps are performed consecutively, one after another.
Note that in this problem you do not have to minimize the number of swaps — your task is to find any sequence that is no longer than n.
The first line of the input contains integer n (1 ≤ n ≤ 3000) — the number of array elements. The second line contains elements of array: a0, a1, ..., an - 1 ( - 109 ≤ ai ≤ 109), where ai is the i-th element of the array. The elements are numerated from 0 to n - 1 from left to right. Some integers may appear in the array more than once.
In the first line print k (0 ≤ k ≤ n) — the number of swaps. Next k lines must contain the descriptions of the k swaps, one per line. Each swap should be printed as a pair of integers i, j (0 ≤ i, j ≤ n - 1), representing the swap of elements ai and aj. You can print indices in the pairs in any order. The swaps are performed in the order they appear in the output, from the first to the last. It is allowed to print i = j and swap the same pair of elements multiple times.
If there are multiple answers, print any of them. It is guaranteed that at least one answer exists.
55 2 5 1 4
20 34 2
610 20 20 40 60 60
0
2101 100
10 1
解题说明:此题可以用投机的方法来做,n个数字交换n次肯定可以得到排序,每次找到最小的数字与对应位置上的数字进行交换即可。
#include<iostream>#include<cstdio>#include<algorithm>#include<cstring>#include<string>#include<cmath>#include<cstdlib>using namespace std;#define MAXN 3000int a[MAXN];void swap(int x, int y){ int tmp; tmp = a[x]; a[x] = a[y]; a[y] = tmp;}int main(){ int N, i, j, min; scanf("%d\n", &N); printf("%d\n", N); for(i=0; i<N; i++) { scanf("%d", a+i); } for(i=0; i<N; i++) { min = i; for(j=i+1; j<N; j++) {if(a[j] < a[min]){min = j;}}printf("%d %d\n", i, min); swap(i, min); } return 0;}
- A. SwapSort
- CF 275.5 A. SwapSort
- Codeforces 489A SwapSort 题解
- Codeforces Round #277.5 (Div. 2)A. SwapSort
- Codeforces Round #277.5 (Div. 2)A——SwapSort
- Codeforces #277.5 (Div. 2) A. SwapSort(基础:选择排序)
- Codeforces Round #277.5 (Div. 2)---A. SwapSort (sort)
- Codeforces Round #277.5 (Div. 2) A SwapSort 我自己写的奇葩代码竟然AC了。。。自己都觉得不可思议
- coderforce--277SwapSort
- 金山笔试题中的SwapSort
- a
- a
- a
- a
- a
- a
- a
- a
- gdb调试程序
- 关于返回405错误。
- 利用朴素贝叶斯算法识别垃圾邮件
- [HTML5&CSS3]20 个酷炫 应用及源码
- marvell 1920开机过程
- A. SwapSort
- [小技巧] gdb里设定动态库的位置
- 第一篇
- 25条div+CSS编程提醒及小技巧整理
- 内核模块USBIP协议描述
- 知名linux网站及论坛推荐
- android中的draw9patch用法
- hdu 4800 Josephina and RPG
- 3个你可能从未用过的HTML标签