## 题目描述

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.

## 输入

There are multiple test cases.
For each test case, the first line has three integers, n, m and k. n is the length of the sequence and is in the range [1, 100000]. m and k are in the range [0, 1000000]. The second line has n integers, which are all in the range [0, 1000000].
Proceed to the end of file.

## 输出

For each test case, print the length of the subsequence on a single line.

## 样例

Sample Input
5 0 0
1 1 1 1 1
5 0 3
1 2 3 4 5

Sample Output
5
4

## AC代码

#### HDU3530 单调队列的应用

2014-11-12 11:50:11

#### 单调队列学习小记 Poj 2823 + Hdu 3530 (deque)

2013-06-17 14:09:19

#### HDU-3530-Subsequence

2014-10-14 22:58:39

#### hdu3530单调队列（双）

2013-04-23 21:07:52

#### hdu3530 Subsequence(单调队列)

2015-09-02 15:09:56

2016-09-05 19:29:31

#### hdu 3530 Subsequence 单调队列

2016-07-12 15:48:56

#### HDU 3530 RMQ+twopointer/单调队列

2015-08-17 00:23:00

#### HDU 3530 单调队列

2014-05-13 20:53:40

#### HDU - 3530 Subsequence 单调队列

2017-01-16 21:15:29

## 不良信息举报

HDU 3530 Subsqueue ( 单调队列