Minimum Adjacency

CodeChefOpen on judge ↗

You are given $N$ buildings with varying heights. There are $Q$ queries given to you. Each query can be of two types: - Change the height of some building - Answer the query with the minimum difference between the heights of 2 adjacent buildings ###Input: The first line contains two integers $N$ and $Q$ denoting the number of buildings and the number of queries respectively. The second line c

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