CF Permutations【排列组合+求和】

B1. Permutations

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

You are given a permutation p of numbers 1, 2, ..., n. Let's define f(p) as the following sum:

Find the lexicographically m-th permutation of length n in the set of permutations having the maximum possible value of f(p).

Input

The single line of input contains two integers n and m (1 ≤ m ≤ cntn), where cntn is the number of permutations of length n with maximum possible value of f(p).

The problem consists of two subproblems. The subproblems have different constraints on the input. You will get some score for the correct submission of the subproblem. The description of the subproblems follows.

• In subproblem B1 (3 points), the constraint 1 ≤ n ≤ 8 will hold.
• In subproblem B2 (4 points), the constraint 1 ≤ n ≤ 50 will hold.

Output

Output n number forming the required permutation.

Sample test(s)

input

2 2

output

2 1 

input

3 2

output

1 3 2 

Note

In the first example, both permutations of numbers {1, 2} yield maximum possible f(p) which is equal to 4. Among them, (2, 1) comes second in lexicographical order.

昨天晚上题都没看懂。。。b数组得开大。。算算8的阶乘多大就知道为何了。

#include<cstdio>
#include<algorithm>
using namespace std;
int a[10],b[50000][10];
int main()
{
	int n,m;
	while(~scanf("%d%d",&n,&m)){
		for(int i=1;i<=n;i++)
		a[i]=i;
		int cnt=0,maxx=0;
		do{
		 int sum=0;
		 for(int i=1;i<=n;i++){
			for(int j=i;j<=n;j++){
				int temp=10;
				for(int k=i;k<=j;k++){
					temp=min(temp,a[k]);
				}
			sum+=temp;
			}
		 }
		 maxx=max(maxx,sum);
		 b[++cnt][0]=sum;
		 for(int i=1;i<=n;i++)
		 b[cnt][i]=a[i];
	    }while(next_permutation(a+1,a+n+1));
	    int num=0;
	    for(int i=1;i<=cnt;i++){
	    	if(b[i][0]==maxx)num++;
	    	if(num==m){
	    		printf("%d",b[i][1]);
	    		for(int j=2;j<=n;j++)
	    		printf(" %d",b[i][j]);
	    		printf("\n");
	    		break;
			}
		}
	}
	return 0;
}