1067. Sort with Swap(0,*) (25)

    当0在0位置时，如果其他的还未完全就位需要浪费一次交换机会。

#include <iostream>#include <cstdio>#include <vector>#include <algorithm>using namespace std;int findPos(vector<int>& per, int st){    for(size_t i = st; i < per.size(); ++i){        if(per[i] != i) return i;    }    return 0;}int main(){int n;cin >> n;vector<int> per(n);for(int i = 0; i < n; ++i){scanf("%d", &per[i]);}int sum = 0, pos = findPos(per, 1);while(pos){        if(per[0] == 0){            swap(per[0], per[pos]);            ++sum;        }        while(per[0] != 0){            int tmp = per[0];            per[0] = per[tmp];            per[tmp] = tmp;            ++sum;        }        pos = findPos(per, pos);}cout << sum;return 0;}