CEMENT_FACTORY

CodeChefOpen on judge ↗

A Cement Factory has been set up by the Ashutosh Pratap. In this Factory there are $N$ stations for transport of cement from one chamber to another chamber. Each Chamber or Each station has a specific height $hi$ and each adjacent station are separated by some distance $di$ . $d1$=distance between building 2 and 1 . So you have two arrays one having $N$ heights of the stations in the factory and

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