LIS and LDS

CodeChefOpen on judge ↗

Chef is very fascinated by the Longest Increasing Subsequence problem. He continues to find many interesting things about them. Along the way he also learned about Longest Decreasing Subsequence problem. Once again, Chef has come up with another problem involving them: Given three integers A, B and N, output a permutation of [1,2,...,N] such that length of the longest increasing subsequence in

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