Ritam and Friends

CodeChefOpen on judge ↗

Ritam loves problems on arrays, so he also expects his friends to be able to solve problems on arrays. While walking back from his class, he thought of testing his friends and came up with a problem. He gives an array to his friends and asks them two types of queries. 1. Update the element at position _i_ to _x_. 2. Find the length of the longest increasing subarray in the range _l_ to _r_. Ritam

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