I am doing this problem that requires me to write an log n algorithm to find the maximum element in a 'STRICTLY CONCAVE DOWN ARRAY' .....

writing the algorithm is not a problem ... however am not able to find (this includes google as well ) what a strictly concave down array means ??

i am presuming that i simply write a mergesort and pop the last element of the array as the maximum ...

please advise ... thanks