Given an array arr of size n find the maximum value of
sum[i....j] X arr[k] where i<=k<=j
1<=n<=5 X 10^5
-10^6 <= arr[i] <= 10^6