Maximizing LIS

CodeChefRating 2079Open on judge ↗

Chef received an array $A$ of $N$ integers as a valentine's day present. He wants to **maximize** the length of the **longest strictly increasing subsequence** by choosing a **subarray** and adding a fixed integer $X$ to all its elements. More formally, Chef wants to **maximize** the length of the [longest strictly increasing subsequence](https://cp-algorithms.com/sequences/longest_increasing_sub

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