1.将k分为k1和k2,分别带入数组,取k1最大值和k2最大值;
2.将两个数组最大值拼接成临时最大值;
3.取出分治获得临时最大值中的最大值。
int* delete_max(int *data, int k, int len, int * temp)
{
int stack[128] = {0};
int top = -1;
int i, j;
int count = 0;
for(i = 0; i < len; i++){
while(top != -1 && (len - count) != k){
if(data[i] > data[top]){
if(stack[top] == -1){
top--;
}
else{
stack[top] = -1;
top--;
count++;
}
}
else
break;
}
top = i;
}
while((len - count) != k){
stack[top] = -1;
top--;
count++;
}
int index = 0;
for(j = 0; j < len; j++){
if(stack[j] == 0){
temp[index] = data[j];
index++;
}
}
}
int *joint_max(int *data1, int len1, int *data2, int len2, int k)
{
int temp1[128];
int temp2[128];
int max_temp[128];
int max[128] = {0};
int i = 0;
for(i; i <= k; i++){
if(i <= len1 && (k - i) <= len2){
printf("i is %d\n", i);
delete_max(data1, i, len1, temp1);
delete_max(data2, k - i, len2, temp2);
int j = 0;
int p = 0;
int q = 0;
while(j < k && p < i && q < (k - i)){
if(temp1[p] >= temp2[q]){
max_temp[j] = temp1[p];
p++;
j++;
}
else{
max_temp[j] = temp2[q];
q++;
j++;
}
}
while(j < k){
if(p < i){
max_temp[j] = temp1[p];
p++;
}
else{
max_temp[j] = temp2[q];
q++;
}
j++;
}
j = 0;
while(j < k){
if(max_temp[j] > max[j]){
int m = 0;
for(m; m < k; m++)
max[m] = max_temp[m];
break;
}
if(max_temp[j] == max[j])
j++;
else
break;
}
}
}
print_int(max, k);
return max;
}