#include <iostream>
using namespace std;
int find(int a[],int low,int high){
if(low==high){
return a[low];
}else{
int mid=(high+low)/2;
int left=find(a,low,mid);
int right=find(a,mid+1,high);
return left>right?left:right;
}
}
int main()
{//时间复杂度O(n)
int a[9]={1,2,3,114,15,6,7,8,9};
cout<<find(a,0,8);
return 0;
}