【基础算法】next_permutation的手动实现

420. 火星人

#include 
#include 
#include 

using namespace std;

const int N = 1e4 + 10;

int n, m;
int w[N];

int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i ++ ) scanf("%d", &w[i]);
    while(m -- )
    {
        int k = n;
        while(w[k - 1] > w[k]) k -- ; 
        int t = k;
        while(w[t + 1] > w[k - 1]) t ++ ;
        swap(w[k - 1], w[t]);
        reverse(w + k, w + n + 1);
    }
    for(int i = 1; i <= n; i ++ ) printf("%d ", w[i]);
    return 0;
}

作者：Once.
链接：https://www.acwing.com/activity/content/code/content/3396797/
来源：AcWing
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。

next_permutation写法

#include 
#include 
#include 

using namespace std;

const int N = 1e4 + 10;

int n, m;
int w[N];

int main()
{
    scanf("%d%d", &n, &m);
    for(int i = 1; i <= n; i ++ ) scanf("%d", &w[i]);
    while(m -- )
    {
        next_permutation(w + 1, w + n + 1);
    }
    for(int i = 1; i <= n; i ++ ) printf("%d ", w[i]);
    return 0;
}

作者：Once.
链接：https://www.acwing.com/activity/content/code/content/3396797/
来源：AcWing
著作权归作者所有。商业转载请联系作者获得授权，非商业转载请注明出处。