I'm having problem to solve this problem in DP:
Given 2 subsequences:
X = {x1, x2,..., xm} and Y = {y1, y2, ... , yn}
so `n <= m` and also `y1 <= y2 <= ... <= yn`.
The goal is to find a sub-sequence of `X` (xi1, xi2, ... , xin) such that:
sum(k is 1 to n) | xik - yk | is...