Greatest Solid

CodeChefOpen on judge ↗

There are N buildings in a certain 2-D landscape. Each building has a height given by hi ,i ∈ [1,N] . If you join K adjacent buildings, they will form a solid rectangle of area K × min(hi,hi+1,...,hi+k-1). Given n buildings, find the greatest such solid area formed by consecutive buildings. Input Format: The first line contains N, the number of buildings altogether. The second line contains N sp

HINT LADDERno hints yet

L1 Observation

L2 Technique

L3 Approach

L4 Pseudo-code

🔒

L5 Full solution

L5 unlocks only if you insist twice

solution.cppC++17

CodeSearch Tutor

Hints, not spoilers — it won’t hand over the full solution unless you insist.

voice by Sarvam AI