Maximum product of sum of two array elements with their distance

Question

Given an array of positive numbers I need to find the maximum of the expression (j - i)*(a[j] + a[i]) where j and i are array indices. I tried using divide and conq