The Valley Floor

A series of ground elevations forms a landscape. For each point $i$, we want to find the width of the largest 'Valley' containing $i$ where the elevation at $i$ is the minimum. Specifically, find the number of contiguous points $[L, R]$ such that for all $k \in [L, R]$, $elevation[k] \ge elevation[i]$. Input Format: A single line of space-separated integers. Output Format: A single line of space-separated integers representing the width of the valley for each point. Example: Input: 3 1 4 2 Output: 1 4 1 2