习题8-13(uva-10570)

#include <iostream>
#include <istream>
#include <sstream>
#include <vector>
#include <stack>
#include <list>
#include <map>
#include <set>
#include <deque>
#include <queue>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
#include <algorithm>
#include <numeric>
#include <chrono>
#include <ctime>
#include <cmath>
#include <cctype>
#include <string>
#include <cstdio>
#include <iomanip>


#include <thread>
#include <mutex>
#include <condition_variable>
#include <functional>
#include <iterator>
using namespace std;
const int maxn = 1007, INF = 1e9;
int n, input[maxn], flag[maxn];

int SwapCnt(int *pStart,int cur)
{
	int ret = 0;
	for (int i = 1; i <= n; i++) {
		if (flag[i] != cur) {
			int tmp = i;
			while (flag[tmp] != cur)
			{
				flag[tmp] = cur;
				tmp = pStart[tmp];
			}
			++ret;
		}
	}
	return n - ret;
}

int main()
{
	while (cin >> n && n) {
		memset(flag, 0, sizeof(flag));
		int ans = INF;
		for (int i = 1; i <= n; i++) cin >> input[i];
		for (int i = 1; i <= n; i++) {
			input[n + i] = input[i];
			ans = min(SwapCnt(input + i - 1,i), ans);
		}
		reverse(input + 1, input + 2 * n + 1);
		for (int i = 1; i <= n; i++) {
			ans = min(SwapCnt(input + i - 1, n+i), ans);
		}
		cout << ans << endl;
	}
	return 0;
}