Approach to solve this in O(N) time

Question

Here i have a question which is a variation of the famous \'Largest Rectangle Under Histogram\' problem: Problem Statement:

We are given a 1-indexed array of N positi