Adjacent Towers

CodeChefOpen on judge ↗

Problem There are N rectangular towers in a certain two-dimensional landscape. Each tower has a height given by hi, i∈[1,N] . If you join K adjacent towers, they will form a solid rectangle of area K ✕ min(hi,hi+1,......hi+k+1). Given N towerss, find the greatest such solid area formed by consecutive towers. Input The first line contains N, the number of towers altogether. The second line con

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