分治法求最大值

#include <iostream>
#include<stdio.h>

using namespace std;

int findMAX(int A[],int n,int m){
        int u,v,x;
        int mid;
        if(n == m) {
        	return A[n];

		}
        else if(n==m-1){
                return max(A[n],A[n+1]);

        }
        else
                {
                        mid = (n+m)/2;
                        u=findMAX(A,n,mid);
                        v=findMAX(A,mid,m);
                        x = max(u,v);

                }
       return x;

}

int main(){
        int m;
        cout<<"Please enter the number of data:";
        scanf("%d",&m);
        int A[100];
        cout<<"Please enter one by one:"<<endl;
        for(int i=0 ; i <m; i++ ){
                scanf("%d",&A[i]);
        }
        printf("MAX value: %d\n",findMAX(A,0,m-1));//数组从0开始

        return 0;
}