Military coding System
CodeChefOpen on judge ↗
Military coding System Input The first number is n, the length of first integer string The next n integers are elements of first sequence The next is m , the length of second sequence The next m integers are elements of second sequence Output One number k, the length of longest possible common subsequence that is increasing Example Input: 5 23140 6 1034100 Output: 2 34
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.
Sign in to chat with the tutor and save your progress.
Sign in to start