代码

#define magic 300
void sort(unsigned *a, int n)
{
    unsigned *b=new unsigned[n];
unsigned *rs[magic], t0[magic], t1[magic], t2[magic], t3[magic];
    unsigned *p;
    for (int i = 0; i < 256; ++i)
    {
        t0[i] = 0;
        t1[i] = 0;
        t2[i] = 0;
        t3[i] = 0;
    }
    for (int i = 0; i < n;)
    {
        ++t0[a[i] & 255], ++t1[a[i] >> 8 & 255], ++t2[a[i] >> 16 & 255], ++t3[a[i] >> 24], ++i;
        ++t0[a[i] & 255], ++t1[a[i] >> 8 & 255], ++t2[a[i] >> 16 & 255], ++t3[a[i] >> 24], ++i;
        ++t0[a[i] & 255], ++t1[a[i] >> 8 & 255], ++t2[a[i] >> 16 & 255], ++t3[a[i] >> 24], ++i;
        ++t0[a[i] & 255], ++t1[a[i] >> 8 & 255], ++t2[a[i] >> 16 & 255], ++t3[a[i] >> 24], ++i;
    }
    p = b - 1;
    for (int i = 0; i < 256; ++i)
        rs[i] = p, p += t0[i];
    for (int i = 0; i < n; i += 4)
    {
        p = a + i;
        *++rs[p[0] & 255] = p[0];
        *++rs[p[1] & 255] = p[1];
        *++rs[p[2] & 255] = p[2];
        *++rs[p[3] & 255] = p[3];
    }


    p = a - 1;
    for (int i = 0; i < 256; ++i)
        rs[i] = p, p += t1[i];
    for (int i = 0; i < n; i += 4)
    {
        p = b + i;
        *++rs[p[0] >> 8 & 255] = p[0];
        *++rs[p[1] >> 8 & 255] = p[1];
        *++rs[p[2] >> 8 & 255] = p[2];
        *++rs[p[3] >> 8 & 255] = p[3];
    }
    p = b - 1;
    for (int i = 0; i < 256; ++i)
        rs[i] = p, p += t2[i];
    for (int i = 0; i < n; i += 4)
    {
        p = a + i;
        *++rs[p[0] >> 16 & 255] = p[0];
        *++rs[p[1] >> 16 & 255] = p[1];
        *++rs[p[2] >> 16 & 255] = p[2];
        *++rs[p[3] >> 16 & 255] = p[3];
    }
    p = a - 1;
    for (int i = 0; i < 256; ++i)
        rs[i] = p, p += t3[i];
    for (int i = 0; i < n; i += 4)
    {
        p = b + i;
        *++rs[p[0] >> 24] = p[0];
        *++rs[p[1] >> 24] = p[1];
        *++rs[p[2] >> 24] = p[2];
        *++rs[p[3] >> 24] = p[3];
    }
}

评测结果