import java.util.*;
public class Main {
public static void main(String[] args) {
Scanner sc = new Scanner(System.in);
int n = sc.nextInt();
int[] arr = new int[n + 1];
int count = 0;
for (int i = 1; i <= n; i++) {
arr[i] = sc.nextInt();
}
for (int i = 1; i <= n; i++) {
//只需要判断当前数是否在其对应的位置上,如果不是则把他换到他对应的位置上
if (arr[i] != i) {
int temp = arr[i];
arr[i] = arr[temp];
arr[temp] = temp;
count++;
i--;
}
}
System.out.println(count);
}
}
P8637 [蓝桥杯 2016 省 B] 交换瓶子
最新推荐文章于 2024-07-12 16:26:30 发布