```\nGiven an array find sum of scores of all possible subarrays of the array.\nScore of a subarray = product of min element and sum of elements in the subarray \nMax Size of array  = 8*10^5\n```\n\n```\nWhat I did in actual test was \nGet all subarrays by varying Li, Ri (2 loops)\nGet sum b/w Li , Ri using prefix sum\nAnd then get min b/w Li, Ri using segment tree min queries\n\n1. Prefix sum pre calculation was O(n)\n2. Creating segment tree O(nlogn)\n3. Looping was n square\n4. Inside loop for each subarray getting sum in O(1), getting min in O(logn) using segment tree querying.\n\nOverall O(n square log n)\n```\n\nWe need a solution with complexity less than O(n^2)

\nGiven an array find sum of scores of all possible subarrays of the array.\nScore of a subarray = product of min element and sum of elements in the subarray \n