算法导论 练习题 8.1-4

int countArea(int a[],int k,int len,int start,int end){if(start>end)return 0;int *c=(int*)malloc((k+1)*sizeof(int));int i,j;for(i=0;i<=k;i++){c[i]=0;}for(i=1;i<=len;i++){c[a[i]]++;}for(i=1;i<=k;i++){c[i]+=c[i-1];}if(start==0)j=c[end];elsej=c[end]-c[start-1];free(c);return j;}