Detail of message

Online Judge

Problem Set

Authors

Online Contests

User

Web Board
Home Page
F.A.Qs
Statistical Charts

Current Contest
Past Contests
Scheduled Contests
Award Contest

基数排序就是好

Posted by fanhqme at 2009-03-08 11:02:32 on Problem 1002

int datas[datamax],tmpa[65536],tmpb[datamax],N;
void raidxsort(){
     memset(tmpa,0,sizeof(tmpa));
     for (int i=0;i<N;++i)++tmpa[(datas[i]&65535)+1];
     for (int i=1;i<65536;++i)tmpa[i]+=tmpa[i-1];
     for (int i=0;i<N;++i)tmpb[tmpa[datas[i]&65535]++]=datas[i];
     memset(tmpa,0,sizeof(tmpa));
     for (int i=0;i<N;++i)++tmpa[(tmpb[i]>>16)+1];
     for (int i=1;i<65536;++i)tmpa[i]+=tmpa[i-1];
     for (int i=0;i<N;++i)datas[tmpa[tmpb[i]>>16]++]=tmpb[i];
}

Followed by:

Re:基数排序就是好 (24) weaker 2009-03-15 17:16:09
Re:基数排序就是好 (501) maymay 2009-03-24 16:45:35

Post your reply here:

Home Page Go Back To top