康拓展开 Test

#include <cstdio>

using namespace std;


typedef long long LL;
/**
*  康拓展开: X=an*(n-1)!+an-1*(n-2)!+...+ai*(i-1)!+...+a2*1!+a1*0!
**/
struct Cantor {
    int N; //数组的大小
    LL *f; //阶乘数组
    Cantor(int n = 9) {
        N = n;
        f = new  LL[N];  f[0] = 1;
        for(int i = 1; i < N; ++i) f[i] = f[i-1] * i;
    }
    /**
    * 康拓展开: 返回该数组的编号,编号从0开始
    **/
    LL getId(int *a) {
        LL Id = 0;
        for(int i = 0; i < N; ++i) {
            int k = 0;
            for(int j = i + 1; j < N; ++j) {
                if(a[i] > a[j]) ++k;
            }
            Id += f[N-i-1] * k;
        }
        return Id;
    }
    /**
    * 逆康拓展开: 返回编号为Id的数组
    **/
    int* getArray(LL Id) {
        int  *a   = new  int[N];
        bool *vis = new bool[N];
        for(int i = 0; i < N; ++i) vis[i] = false;
        for(int i = 0; i < N; ++i) {
            int digit = Id / f[N-i-1];
            Id %= f[N-i-1];
            a[i] = 0;
            while(digit >= 0) {
                if(!vis[++a[i]]) --digit;
            }
            vis[a[i]] = true;
        }
        return a;
    }

};

int main(int argc, char **argv) {
    int N = 7;
    Cantor cantor = Cantor(N);
    int *a = cantor.getArray(900);
    //delete a; //去掉后试试看……
    for(int i = 0; i < N; ++i) printf("%d ", a[i]);
    putchar('\n');
    printf("%lld\n", cantor.getId(a));
    return 0;
}