CodeForces 505C Mr. Kitayuta, the Treasure Hunter

Mr. Kitayuta, the Treasure Hunter

Time Limit: 1000MS     Memory Limit: 262144KB     64bit IO Format: %I64d & %I64u

Description

The Shuseki Islands are an archipelago of 30001 small islands in the Yutampo Sea. The islands are evenly spaced along a line, numbered from 0 to 30000 from the west to the east. These islands are known to contain many treasures. There are n gems in the Shuseki Islands in total, and the i-th gem is located on island p_i.

Mr. Kitayuta has just arrived at island 0. With his great jumping ability, he will repeatedly perform jumps between islands to the east according to the following process:

• First, he will jump from island 0 to island d.
• After that, he will continue jumping according to the following rule. Let l be the length of the previous jump, that is, if his previous jump was from island prev to island cur, let l = cur - prev. He will perform a jump of length l - 1, l or l + 1 to the east. That is, he will jump to island (cur + l - 1), (cur + l) or (cur + l + 1) (if they exist). The length of a jump must be positive, that is, he cannot perform a jump of length 0 when l = 1. If there is no valid destination, he will stop jumping.

Mr. Kitayuta will collect the gems on the islands visited during the process. Find the maximum number of gems that he can collect.

Input

The first line of the input contains two space-separated integers n and d (1 ≤ n, d ≤ 30000), denoting the number of the gems in the Shuseki Islands and the length of the Mr. Kitayuta's first jump, respectively.

The next n lines describe the location of the gems. The i-th of them (1 ≤ i ≤ n) contains a integer p_i (d ≤ p₁ ≤ p₂ ≤ ... ≤ p_n ≤ 30000), denoting the number of the island that contains the i-th gem.

Output

Print the maximum number of gems that Mr. Kitayuta can collect.

Sample Input

Input

4 10
10
21
27
27

Output

3

Input

8 8
9
19
28
36
45
55
66
78

Output

6

Input

13 7
8
8
9
16
17
17
18
21
23
24
24
26
30

Output

4

Hint

In the first sample, the optimal route is 0  →  10 (+1 gem)  →  19  →  27 (+2 gems)  → ...

In the second sample, the optimal route is 0  →  8  →  15  →  21 →  28 (+1 gem)  →  36 (+1 gem)  →  45 (+1 gem)  →  55 (+1 gem)  →  66 (+1 gem)  →  78 (+1 gem)  → ...

In the third sample, the optimal route is 0  →  7  →  13  →  18 (+1 gem)  →  24 (+2 gems)  →  30 (+1 gem)  → ...

记忆化搜索。

一开始只开了一个一位数组来存储状态，总是不对，思考了很久，才明白dp[x]的值不是一定的，同样是dp[x],不同步长的值是不同的.

这里步长用到的是偏移量。

#include <iostream>
#include <cstdio>
#include <cstring>
#include <algorithm>
#include <set>
#include <queue>

using namespace std;
#define maxn 30005
#define inf 0x7ffffff
pair <int ,int > p;
int arr[maxn];
int dp[maxn][600];
int n,d;
int num;
int findG(int x,int len);
int main()
{
    scanf("%d%d",&n,&d);
    memset(arr,0,sizeof(arr));
    memset(dp,-1,sizeof(dp));
    int tmp ;
    num = -inf;
    for(int i = 0; i < n; i++){
        scanf("%d",&tmp);
        arr[tmp] ++;
        if(num < tmp){
            num = tmp;
        }
    }
   int ans = arr[0];
   ans += findG(d,d);
    printf("%d\n",ans);
    return 0;
}
int findG(int x,int len){
    if(len <= 0){
        return 0;
    }
    if(x > num){
        return 0;
    }
    if(dp[x][len - d + 300] != -1){
        return dp[x][len - d + 300];
    }
    int left = findG(x+len-1,len-1);
    int mid = findG(x+len,len);
    int right = findG(x+len+1,len+1);
    return dp[x][len - d + 300] = arr[x] + max(mid,max(left,right));
}