← All problemsSign in

F - Stone Land

CodeChefRating 2557Open on judge ↗

In a country **Stone Land**, there are $N$ stones arranged in a row from left to right. Each stone has some height represented by a positive number. The stones are numbered from $1$ to $N$ from left to right. You are given an array **H** of size $N$ consisting of the height of the $N$ stones from left to right. Stone at $j^{th}$ position is visible from the stone at $i^{th}$ position if:-

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

Sign in to chat with the tutor and save your progress.

Sign in to start