Longest Constrained Subsequence

You are given two arrays of length N. Array A = $A$1, $A$2, ..., $A$N. Array L = $L$1, $L$2, ..., $L$N. For every k such that $1 \leq k \leq N$, you have to find the length of the longest possible subsequence in the first k elements of array A such that if $A$j immediately follows $A$i in the subsequence, then $|A$j$-A$i$| \leq L$j Please note that the input is __encrypted__. Read Input section f