Algorithmic puzzle asked in an interview

today i got stuck on the following problem.kindly provide some clue,the statement is following: Given an array A[] of size n.Maximize A[i]*A[j]*A[k] under the following constraints:

a). i<j<k
b).A[i]<A[j]<A[k]

Thank u.