There is a sequence of integers. Your task is to find the longest subsequence that satisfies the following condition: the difference between the maximum element and the minimum element of the subsequence is no smaller than m and no larger than k.
注意这题题目描述不严谨，准确来说不是子序列，应该是子区间
5 0 0 1 1 1 1 1 5 0 3 1 2 3 4 5
5 4