Given an int array,
given pair i,j => min(array[i], .... array[j]) * sum(arr[i], ... arr[j])
sum values for all pair i,j
module 10 ^ 9 + 7

Solution.
n log(n)

Nice problem.