Advertisements
CodeChefOpen on judge ↗
Advertisements are necessary to attract more and more crowd. BITS has a wall for putting up posters. The wall can be thought of $N$ slabs of width 1 and arbitrary height. All the slabs are adjacent without any gaps. A banner has to be put up on the wall. The team wants to know how huge the banner can be put up so there will be $M$ queries consisting of 3 integers $l, r$ and $w$. Following rules
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.
Sign in to chat with the tutor and save your progress.
Sign in to start