你需要知道的基础算法知识——STL和基础数据结构（八）

引言

STL是C++的标准模板库，竞赛中很多常用的数据结构、算法在STL中都有，熟练地掌握它们在很多题目中能极大地简化编程。
STL包括容器（container）、迭代器（iterator）、空间配置器（allocator）、配接器（adapter）、算法（algorithm）、仿函数（functor）6个部分。竞赛的重点是STL容器。

8.next_permutation( )

next_permutation()是STL中的排列组合函数。例如3个字符a、b、c，使用next_permutation()可以返回6个组合，即abc、acb、bac、bca、cab、cba。

例题

hdu 1027
Ignatius and the Princess II
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)

Problem Description
Now our hero finds the door to the BEelzebub feng5166. He opens the door and finds feng5166 is about to kill our pretty Princess. But now the BEelzebub has to beat our hero first. feng5166 says, “I have three question for you, if you can work them out, I will release the Princess, or you will be my dinner, too.” Ignatius says confidently, “OK, at last, I will save the Princess.”
“Now I will show you the first problem.” feng5166 says, “Given a sequence of number 1 to N, we define that 1,2,3…N-1,N is the smallest sequence among all the sequence which can be composed with number 1 to N(each number can be and should be use only once in this problem). So it’s easy to see the second smallest sequence is 1,2,3…N,N-1. Now I will give you two numbers, N and M. You should tell me the Mth smallest sequence which is composed with number 1 to N. It’s easy, isn’t is? Hahahahaha…”
Can you help Ignatius to solve this problem?

Input
The input contains several test cases. Each test case consists of two numbers, N and M(1<=N<=1000, 1<=M<=10000). You may assume that there is always a sequence satisfied the BEelzebub’s demand. The input is terminated by the end of file.

Output
For each test case, you only have to output the sequence satisfied the BEelzebub’s demand. When output a sequence, you should print a space between two numbers, but do not output any spaces after the last number.

Sample Input
6 4
11 8

Sample Output
1 2 3 5 6 4
1 2 3 4 5 6 7 9 8 11 10

AC代码

#include <iostream>
#include <bits/stdc++.h>
using namespace std;

int main()
{
    int a[1001];
    int n,m;
    while(cin>>n>>m){
        for(int i=1;i<=n;i++){
            a[i]=i;
        }
            int b=1;
            do{
                if(b==m) break;
                b++;
            }while(next_permutation(a+1,a+n+1));
            for(int i=1;i<n;i++){
                cout<<a[i]<<" ";
            }
            cout<<a[n]<<endl;

    }
    return 0;
}

如有错误

欢迎指出