【HDU】4985 Little Pony and Permutation 置换群

最新推荐文章于 2021-07-22 19:16:58 发布

poursoul

最新推荐文章于 2021-07-22 19:16:58 发布

阅读量542

点赞数

分类专栏：数学文章标签： HDU

本文链接：https://blog.csdn.net/u013368721/article/details/39053469

版权

数学专栏收录该内容

25 篇文章 0 订阅

订阅专栏

传送门：【HDU】4985 Little Pony and Permutation

题目分析：基本置换群。内部排序反而错！

代码如下：

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

#define REP( i , a , b ) for ( int i = ( a ) ; i <  ( b ) ; ++ i )
#define FOR( i , a , b ) for ( int i = ( a ) ; i <= ( b ) ; ++ i )
#define REV( i , a , b ) for ( int i = ( a ) ; i >= ( b ) ; -- i )
#define CLR( a , x ) memset ( a , x , sizeof a )

const int MAXN = 100005 ;

int a[MAXN] ;
bool vis[MAXN] ;
int S[MAXN] , top ;
int n ;

void scanf ( int& x , char c = 0 ) {
	while ( ( c = getchar () ) < '0' || c > '9' ) ;
	x = c - '0' ;
	while ( ( c = getchar () ) >= '0' && c <= '9' ) x = x * 10 + c - '0' ;
}

void solve () {
	CLR ( vis , 0 ) ;
	FOR ( i , 1 , n ) scanf ( a[i] ) ;
	FOR ( i , 1 , n ) if ( !vis[i] ) {
		int now = i ;
		top = 0 ;
		while ( !vis[now] ) S[top ++] = now , vis[now] = 1 , now = a[now] ;
		printf ( "(" ) ;
		REP ( j , 0 , top - 1 ) printf ( "%d " , S[j] ) ;
		printf ( "%d)" , S[top - 1] ) ;
	}
	printf ( "\n" ) ;
}

int main () {
	while ( ~scanf ( "%d" , &n ) ) solve () ;
	return 0 ;
}