Your browser does not seem to support JavaScript. As a result, your viewing experience will be diminished, and you may not be able to execute some actions.
Please download a browser that supports JavaScript, or enable it if it's disabled (i.e. NoScript).
Difficulty: Easy Time Limit: 10 minutes
Maximize A[P] * A[Q] * A[R] for any triplet (P, Q, R).
A[P] * A[Q] * A[R]
A non-empty array A consisting of N integers is given. The product of triplet (P, Q, R) equates to A[P] * A[Q] * A[R] (0 ≤ P < Q < R < N).
A[P] * A[Q] * A[R] (0 ≤ P < Q < R < N)
