为什么不建议做运维_贵阳手机网站制作_长尾关键词挖掘词工具_广州营销优化

#include<iostream>
#include<vector>
#include<cmath>
using namespace std;
int main() {int n;cin >> n;vector<int> s(n + 1);for (int i = 1; i <= n; i++)cin >> s[i];int count = 0;int i = 1;while (i <= n) {if (s[i] != i) {count++;swap(s[i], s[s[i]]);}else i++;}cout << count << endl;return 0;
}