Can anyone explain the following question's solution or have a link to the explained editorial? The link for the question : https://www.codechef.com/problems/TRICHEF

Given an array of elements. Find the maximum value that can be formed using the operators +, -, * and / used in any order.

There is no link to the problem. I was asked this question in an interview, but didn't find a solution,so thought of posting it.

https://www.geeksforgeeks.org/count-number-triplets-product-equal-given-number/
Can someone provide a faster solution.
Constraints : 1 <= n <= 1e5
1 <= x,A[i] <= 1e7 for all 1<= i <=n

Can someone provide a video link for convex trick ?? i have tried to read the wiki,but still couldn't understand the concept.

Can anyone check my solution Id. 34415408. I don't know why it is giving TLE. Code link : http://mirror.codeforces.com/contest/86/submission/34415408