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

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 integerpi (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

        题意：有30001个岛屿里有n个宝藏，主角奇怪的走法为前次跳了距离d，则下次只能跳d-1、d、d+1 ；问结束时得到gem的max。

       题解：想想就知道用dp大法了，不过无优化肯定报；后来参考了 码谜 网的一篇介绍； 了解了思路代码不小心写雷同了--囧--

#define INF 0x7fffffff
#define eps (1e-9)
#define mid 250
#define maxn 199999999
#define clearto(s,x) memset(s,x,sizeof(s))
using namespace std;

int n, m, tot=0;
int d;
int gem[30009];
int dp[30009][555];
int main()
{
    //freopen("E:\DATA.txt","r",stdin);
    //int TT=1,tt+=1;            scanf("%d",&TT);
    int i=0,j=0,k=0,t=0;
    scanf("%d %d",&n,&d);
    clearto(gem,0);             clearto(dp,-1);
    for(i=1;i<=n;i++){
        scanf("%d",&k);
        gem[k]++;               //俩钻石是可以在同一个地方的哦，5555
    }
    dp[d][mid]=gem[d];          //所有Pi是大于d的
    int ans=dp[d][mid];
    for(i=d;i<30001;i++){
        for(k=0;k<=500;k++)                 // 步长 d 线性映射为 mid
        {
            if(dp[i][k]==-1)    continue;
            int ds= k-mid;
            int to= i+d+ds;
            if(to<30001){
               dp[to][k]=max(dp[to][k],dp[i][k]+gem[to]);
               ans=max(ans,dp[to][k]);
               //if(to<30){ printf("%d %d "); }
            }
            if(to+1<30001){
               dp[to+1][k+1]=max(dp[to+1][k+1],dp[i][k]+gem[to+1]);
               ans=max(ans,dp[to+1][k+1]);
            }
            if(to-1<30001&&d+ds-1>0)      //d+ds-1才是此处的跳跃距离
            {
               dp[to-1][k-1]=max(dp[to-1][k-1],dp[i][k]+gem[to-1]);
               ans=max(ans,dp[to-1][k-1]);
            }
        }
    }
    printf("%d",ans);
    return 0;
}