pku 1674 Sorting by Swapping

#include <iostream> #include <climits> #include <algorithm> using namespace std; int map[10005]; int main() { int N, n; scanf("%d", &N); while(N--) { scanf("%d", &n); for(int i = 1; i <= n; ++i) scanf("%d", &map[i]); int cnt = 0; for(int i = 1; i < n; ++i) if(map[i] != i) { swap(map[i], *(find(map+i+1, map+n+1, i))); cnt++; } printf("%d/n", cnt); } return 0; }