seppol的专栏

转载 O(nlogn)实现逆序数求值

const int LENGTH=100; int temp[LENGTH]; //额外的辅助数组 int count=0; void Merge(int * array,int first,int med,int last) { int i=first,j=med+1; int cur=0; while (i<=med&&j<=last) { if (array[i]<arra