#include <bits/stdc++.h>
using namespace std;
int n, ans, c[10012023];
struct student {
int a, b;
} Q[19202922];
int cmp(student a, student b) {
return a.a < b.a;
}
int main() {
cin >> n;
for (int i = 1; i <= n; i++) {
cin >> Q[i].a;
Q[i].b = i;
}
sort(Q + 1, Q + n + 1, cmp);
for (int i = 1; i <= n; i++) {
c[Q[i].b] = i;
}
for (int i = 1; i <= n; ++i) {
while (c[i] != i) {
swap(c[i], c[c[i]]);
ans++;
}
}
cout << ans;
return 0;
}```
P1327 数列排序
最新推荐文章于 2024-07-20 09:21:06 发布