Maximum Subsequence Problem

CodeChefOpen on judge ↗

Given an array of N numbers, select the longest subsequence of numbers and give the output as the length that subsequence. You are allowed to increment any number of integers in that array by 1, once so as to get the maximum length of the subsequence. ###Input: First line contains an integer N. Second line contains N integers. ###Output: Output an integer denoting the maximum length of subsequ

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