codeforces 505C Mr. Kitayuta, the Treasure Hunter( dp 缩减规模 )

C. Mr. Kitayuta, the Treasure Hunter

        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.

Examples

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

          题意： 有30001个岛，从西到东标号为0到3000, 一开始从0跳到d, 上次跳得长度为l, 这次可以跳 l -1, l, 或l + 1长度，但跳得长度不能为0,也不能跳到30000以外的地方。在一些岛上有宝石，宝石总数目为n,求最多能拿到多少宝石。

         思路：dp[i][j] 表示到达i岛屿且上次跳的长度为j时能取到的最大宝石数目。转移很简单。但时间和空间复杂度有点大。长度每次加1,d + (d + 1) + (d + 2) + ... + (d + 245) ≥ 1 + 2 + ... + 245 = 245·(245 + 1) / 2 = 30135 > 30000.长度最大也是d+245； 对于长度减1,最小是d-245，所以第二维就可以缩减到500以内，按官方题解来说这是O(m^1.5)。

详细见代码：

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

using namespace std;

const int maxn = 3*1e4+10;

int dp[maxn][510];;
int num[maxn];

int main()
{
	int base;
	int a, b;
	int n, m, d;
	int i, j, k;
	scanf("%d %d",&n,&d);
	for(i = 1; i <= n; i++)
		scanf("%d", &a), num[a]++;
	base = max(d -250,0);
	memset(dp, -1, sizeof dp);
	dp[d][d-base] = num[d];
	int ans=0;
	for(i = d ; i <= 30000; i++)
	{
		for( j = 1 ;j <= 500; j++)
		{
			if(dp[i][j] == -1) continue;
			for(k = -1; k < 2; k++)
			{
				if( j + k < 1|| base + i + j + k > 30000) continue;
				dp[i + base + j + k][j + k] = max(dp[base + i + j + k][j + k], dp[i][j] + num[i + j + k + base]);
			}
			ans = max(ans, dp[i][j]);
		}
	}
	cout << ans << endl;
	return 0;
}