c_cpp 找到数组中的最大元素，该元素首先增加然后减少

Posted 2021-05-14

//https://www.geeksforgeeks.org/find-the-maximum-element-in-an-array-which-is-first-increasing-and-then-decreasing/
#include<iostream>
using namespace std;

int binary(int a[],int l,int r) {
    if (l<=r){
        for (int i=l;i<=r;i++)
            cout<<a[i];
        cout<<"\n";

        int m=(l+r)/2;
        if (a[m] > a[m-1] && a[m]>a[m+1])
            return m;
        else if ( (a[m-1] > a[m]) && (a[m] > a[m+1]) )
            return binary(a,l,m-1);
        else if ( (a[m] < a[m+1]) && (a[m-1] < a[m]) )
            return binary(a,m+1,r);
    }
    return 0;
}

int main(){
    int n,x;
    cin>>n;
    int a[n];
    for(int i=0;i<n;i++)
        cin>>a[i];

    int j=binary(a,0,n-1);
    cout<<"j: "<<j; //using binary search
    cout<< "Element is: "<<a[j];
}