Question

A non-empty array A consisting of N numeric values is
given.
The product of quadruplet (P, Q, R, S) equates to A[P] *
A[Q] * A[R] * A[S]
(0 < P<Q<R<S< N).
For example, array A such that:
A[0] = -3
A[5] = 6
A[3] = -2
A[1] = 1 A[2] = 2
A[6] = 1
A[4] = 5
• (0, 1, 2, 3), product is -3* 1 * 2*-2 = 12
• (1, 2, 4, 5), product is 1*2*5* 6 = 30
• (2,4,5,6), product is 2*5*6* 1 = 60
60 is the product of quadruplets (2, 4, 5, 1), which is
maximal.
code to find maximal product in c language ​

Answer 1

Answer:

I think no answer . its complicated