Yash and his Maximum Length Subarray

CodeChefOpen on judge ↗

Given an array $A$ of size $N$. Your task is to find maximum length of longest non-decreasing sub-array by removing at most $K$ elements from $A$. Input: First line of input contains two space separated integers - $N$ denoting size of array and $K$ denoting maximum number of elements that can be removed. Second Line of Input contains the array $A$. Output: Output a single integer representing

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