PAT(甲级)1067
来源:互联网 发布:小米笔记本能装linux 编辑:程序博客网 时间:2024/05/20 04:27
1067. Sort with Swap(0,*) (25)
Given any permutation of the numbers {0, 1, 2,..., N-1}, it is easy to sort them in increasing order. But what if Swap(0, *) is the ONLY operation that is allowed to use? For example, to sort {4, 0, 2, 1, 3} we may apply the swap operations in the following way:
Swap(0, 1) => {4, 1, 2, 0, 3}
Swap(0, 3) => {4, 1, 2, 3, 0}
Swap(0, 4) => {0, 1, 2, 3, 4}
Now you are asked to find the minimum number of swaps need to sort the given permutation of the first N nonnegative integers.
Input Specification:
Each input file contains one test case, which gives a positive N (<=105) followed by a permutation sequence of {0, 1, ..., N-1}. All the numbers in a line are separated by a space.
Output Specification:
For each case, simply print in a line the minimum number of swaps need to sort the given permutation.
Sample Input:10 3 5 7 2 6 4 9 0 8 1Sample Output:
9
#include <cstdio>#include <cstring>#define SIZE 100005int a[SIZE];int aindex[SIZE];void swap(int &a,int &b){int tmp=a;a=b;b=tmp;}int main(){int N,i,tmp,count=0;scanf("%d",&N);memset(a,0,sizeof(int)*SIZE);memset(aindex,0,sizeof(int)*SIZE);for(i=0;i<N;i++){scanf("%d",&tmp);a[i] = tmp;aindex[tmp] =i;}for(i=0;i<N;i++){if(a[i] != i){swap(a[i],a[aindex[i]]);count++;}}printf("%d\n",count);return 0;}
- PAT(甲级)1067
- *浙大PAT甲级 1067
- PAT甲级1067
- PAT 甲级
- PAT甲级 A1025.PAT RANKING
- PAT 甲级 1025 PAT Ranking
- PAT(甲级)1003
- PAT(甲级)1004
- PAT(甲级)1005
- PAT(甲级)1006
- PAT(甲级)1007
- PAT(甲级)1008
- PAT(甲级)1009
- PAT(甲级)1010
- PAT(甲级)1011
- PAT(甲级)1012
- PAT(甲级)1013
- PAT(甲级)1014
- 暑假集训第三周STL 大小写的全排列
- Linux常用命令之压缩与解压命令
- VC++ 下FFT试验
- vim每日一练(三)——查找匹配
- 线段树构造
- PAT(甲级)1067
- HDFS 2.7.1 所有配置项
- Android Studio 导入 Eclipse 的代码后,运行时中文显示乱码
- Android自定义View遇到的问题
- android开发之android:process属性_application中onCreate执行多次
- java多线程环境下对变量的读写操作的原子性问题
- PAT(甲级)1068
- iOS开发-常用第三方开源框架介绍
- Matlab 图像处理-哈夫曼编码(huffman)