HDU 4985 Little Pony and Permutation(置换)

最新推荐文章于 2018-12-01 18:02:58 发布

lab104_yifan

最新推荐文章于 2018-12-01 18:02:58 发布

阅读量980

点赞数

分类专栏：数论-群论

本文链接：https://blog.csdn.net/accelerator_/article/details/38980213

版权

数论-群论专栏收录该内容

12 篇文章 0 订阅

订阅专栏

HDU 4985 Little Pony and Permutation

题目链接

题意：给定一个置换，输出分解成的循环

水题，直接模拟即可

代码：

#include <cstdio>
#include <cstring>
#include <algorithm>
#include <vector>
using namespace std;

const int N = 100005;

int n, a[N], vis[N];

int main() {
	while (~scanf("%d", &n)) {
		memset(vis, 0, sizeof(vis));
		for (int i = 1; i <= n; i++)
			scanf("%d", &a[i]);
		for (int i = 1; i <= n; i++) {
			if (vis[i]) continue;
			int t = i;
			printf("(%d", t);
			vis[t] = 1;
			t = a[t];
			while (vis[t] == 0) {
				vis[t] = 1;
				printf(" %d", t);
				t = a[t];
			}
			printf(")");
		}
		printf("\n");
	}
	return 0;
}