hdu 2610 全排列

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

王莞原

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

阅读量304

点赞数

分类专栏：普通算法文章标签：算法

本文链接：https://blog.csdn.net/qq_36988616/article/details/70216512

版权

普通算法专栏收录该内容

37 篇文章 0 订阅

订阅专栏

#include <cstdio>
#include <cmath>
#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cstring>
using namespace std;
int n, P, NUM, N;       //N 表示此次输出的个数
void Print(int arr[], int n);
bool visited[1005];
int Arr[1005];

void Permutation(int arr[], int n, int pre_idx)
{
    if (P == 0)
        return;
    if (n == N)
    {
        Print(arr, n);
        --P;
        return;
    }
    for (int i = pre_idx + 1; i <= NUM; ++i)
    {
        if (!visited[i] && Arr[pre_idx] <= Arr[i])
        {
            bool flag = true;       //判重，要是在pre_idx 到此选的元素中有相等的，则会重复
            for (int j = pre_idx + 1; j < i; ++j)
                if (Arr[j] == Arr[i])
                {
                    flag = false;
                    break;
                }
            if (!flag)
                continue;
            visited[i] = true;
            arr[n] = Arr[i];
            Permutation(arr, n + 1, i);
            visited[i] = false;
        }
    }
}
int main(void)
{
    freopen("in.txt", "r", stdin);
    freopen("out.txt", "w", stdout);

    int arr[1005];
    while (cin >> NUM >> P)
    {
        memset(visited, false, sizeof(visited));
        for (int i = 1; i <= NUM; ++i)
            scanf("%d", &Arr[i]);
        Arr[0] = -(1 << 31);
        for (int i = 1; P > 0 && i <= NUM; ++i)
        {
            int now_p = P;
            N = i;
            Permutation(arr, 0, 0);
            if (now_p == P)
                break;
        }
        cout << endl;
    }
    return 0;
}

void Print(int arr[], int n)
{
    for (int i = 0; i < n - 1; ++i)
        printf("%d ", arr[i]);
    printf("%d\n", arr[n - 1]);
}