代码

#include <cstdio>
#include <algorithm>

int d[10];

// lexicographical_order 11.888 ms
void lexicographical_order(const int size)
{
    int tot = 1, i, j;
    for (i = 0; i < size; i++) d[i] = i+1, tot *= i+1;
    while (--tot) 
    {
        i = size - 2;
        while (d[i] > d[i+1]) i--;
        j = size - 1;
        while (j != i) {
            if (d[j] > d[i]) {
                std::swap(d[j], d[i]);
                break;
            } else j--;
        }
        i++;
        j = size - 1;
        while (i < j) {
            std::swap(d[i], d[j]);
            i++; j--;
        }
    }
}

int main()
{
    lexicographical_order(10);
    return 0;
}

评测结果