Codeforces Round #286 (Div. 2) C. Mr. Kitayuta, the Treasure Hunter dp

C. Mr. Kitayuta, the Treasure Hunter

time limit per test

1 second

memory limit per test

256 megabytes

input

standard input

output

standard output

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 pi.

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 pi (d ≤ p1 ≤ p2 ≤ ... ≤ pn ≤ 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 test(s)

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

Note

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)  → ...

题意，给出n个宝石的位置，一个人初始起d步，以后，每步可以走d - 1 d d+1步到别外的位置上取宝石，问最多能取走
多少宝石。

很容易想到一个dp方程dp[i][k]表示走到第i个位置，这时用的步数为k步，则可由dp[i-k][k-1]  dp[i-k][k] dp[i-k][k+1]三步

推出。但由于n太大，用n*n的时间内存是不可以接受的，这里，就要考虑到这题的特殊性了。第一步为d,第二步最大

d+ 1  d+2 d+3 ...这是等差数列，由等差数列的公式，可得，(d + d + k) * k /2,这里明显步数最大也只有sqrt(3000),我们把

300映射成d,则第二维只有最大600，就可以了。复杂度为o(n^(1.5)),故可以得到解。

#define N 30050
#define M 600
#define maxn 205
#define MOD 1000000000000000007
int n,pri[N],dp[N][M],t,maxx,stepM,d,ans;
int main()
{
     while(S2(n,d)!=EOF)
    {
        fill(pri,0);
        fill(dp,-1);
        maxx = -1;
        FI(n){
            S(t);
            maxx = max(maxx,t);
            pri[t]++;
        }
        stepM = M;
        dp[d][300] = pri[d];
        ans = dp[d][300];
        for(int i = d+1;i<=maxx;i++){
            for(int k = 1;k <= stepM;k++){
                int step = k - 300 + d;
                int j = i - step;
                if(j >=0 && step > 0){
                    if(step >= 1 && dp[j][k-1] != -1)
                        dp[i][k] = max(dp[i][k],dp[j][k-1] + pri[i]);
                    if(dp[j][k] != -1)
                        dp[i][k] = max(dp[i][k],dp[j][k] + pri[i]);
                    if(k + 1 < stepM && dp[j][k+1] != -1)
                        dp[i][k] = max(dp[i][k],dp[j][k+1] + pri[i]);
                }
                ans = max(ans,dp[i][k]);
            }
        }
        printf("%d\n",ans);
    }
    return 0;
}