代码

#include <algorithm>

void sort(unsigned *a, int n) {
#define N 100000000
#define D 256
#define D1 255
#define cal(w,w2,tw,op)\
p=w2-1;\
for(i=0;i<D;++i)rs[i]=p,p+=tw[i];\
for(i=0;i<N;i+=8){\
	p=w+i;\
	*++rs[p[0]op]=p[0];\
	*++rs[p[1]op]=p[1];\
	*++rs[p[2]op]=p[2];\
	*++rs[p[3]op]=p[3];\
	*++rs[p[4]op]=p[4];\
	*++rs[p[5]op]=p[5];\
	*++rs[p[6]op]=p[6];\
	*++rs[p[7]op]=p[7];\
}
    unsigned b[N],*rs[D],t0[D],t1[D],t2[D],t3[D];
    register unsigned*p,i,x;
    for(i=0; i<D; ++i) {
        t0[i]=0;
        t1[i]=0;
        t2[i]=0;
        t3[i]=0;
    }
    for(i=0; i<N;) {
#define A x=a[i];++t2[x>>16&D1];++t3[x>>24];++i;
        A A A A A A A A
    }
    cal(a,b,t2,>>16&D1);
    cal(b,a,t3,>>24);
    static unsigned z[2048];
    unsigned last=0;int qr=0,k=0;
    for (; k<n; ++k) {
        unsigned now = a[k];
        if ((last^now)>0xffff) {
            std::sort(a+qr, a+k); qr=k;
        }
        last = now;
    }
    last = 0xffff0000U;
            std::sort(a+qr, a+k); qr=k;
}

评测结果