CARDS POJ - 1721（置换循环节）

题意

给出一个已经置换s次的序列，求原序列

思路

计算循环长度cnt，然后再让输入的序列置换cnt-s%cnt次就可以得到原序列了

#include<iostream>
#include<algorithm>
#include<cstring>
#include<queue>
#include<cstdio>
using namespace std;
const int MAXN = 1010;
int a[MAXN], b[MAXN];
int n, m;
int cnt = 0;
int temp[MAXN];
int main() {
	while (scanf("%d%d", &n, &m) != EOF) {
		cnt = 0;
		for (int i = 1; i <= n; i++) {
			scanf("%d", &a[i]);
			b[i] = a[i];
		}
		while(1) {
			for (int j = 1; j <= n; j++) {
				temp[j] = b[b[j]];
			}
			for (int j = 1; j <= n; j++) {
				b[j] = temp[j];
			}
			int flag = 0;
			cnt++;
			for (int j = 1; j <= n; j++) {
				if (b[j] == a[j]) {
					flag = 1;
					break;
				}
			}
			if (flag)break;
		}
		cnt = cnt - m % cnt;
		for (int i = 1; i <= cnt; i++) {
			for (int j = 1; j <= n; j++) {
				temp[j] = b[b[j]];
			}
			for (int j = 1; j <= n; j++) {
				b[j] = temp[j];
			}
		}
		for (int i = 1; i <= n; i++)
			printf("%d\n", b[i]);
	}
	return 0;
}