递归分治策略求最大C语言实现

#include<stdio.h>
#include<iostream>
#include<stdlib.h>
using namespace std;

int arr[10];
void getMax_Min(int left,int right,int &maxNum,int &minNum){
	if(left==right){
		maxNum=arr[left];
		minNum=arr[left];
		return ;
	}else if(left+1==right){
		maxNum=arr[left]>arr[right]?arr[left]:arr[right];
		minNum=arr[left]>arr[right]?arr[right]:arr[left];
		return ;
	}else{
		int mid=(left+right)/2;
		int leftMax,leftMin,rightMax,rightMin;
		getMax_Min(left,mid,leftMax,leftMin);
		getMax_Min(mid,right,rightMax,rightMin);
		maxNum=max(leftMax,rightMax);
		minNum=min(leftMin,rightMin);
	}
}

int main(){
    int n;
    cin>>n;
	for(int i=0;i<n;i++){
		cin>>arr[i];
	}
	int maxNum,minNum;
	getMax_Min(0,n,maxNum,minNum);
	cout<<maxNum<<endl;
	return 0;
}