Monotone Subsequences

CSESConstruction ProblemsOpen on judge ↗

Your task is to create a permutation of numbers 1,2,\dots,n whose longest monotone subsequence has exactly k elements. A monotone subsequence is either increasing or decreasing. For example, some monotone subsequences in [2,1,4,5,3] are [2,4,5] and [4,3]. Input The first input line has an integer t: the number of tests. After this, there are t lines. Each line has two integers n and k. Output

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