CF - 286 - div2 - C - Mr. Kitayuta, the Treasure Hunter (DP)

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.

Example
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)  → …

题目链接：http://codeforces.com/problemset/problem/505/C


题意：输入一个 n ，d。接下来 n 行代表第 i 颗砖石所在的坐标 pi。一开始从 0 开始跳跃 d 距离，接下来的跳跃距离是 【当前坐标 - 上一个坐标】 加一 或 减一 或 不变。问：最多可以获得多少砖石？（不允许跳跃距离为 0）

数据范围：1 ≤ n, d ≤ 30000 ， d ≤ p1 ≤ p2 ≤ … ≤ pn ≤ 30000。


解题思路：我们很容易想到：$dp[i][j]$ （跳到坐标 i ，跳跃距离为 j 时所能得到的最多砖石数量。） 这个状态。但是 d 的范围是 1 <= d <= 30000，数组存不下。所以就要想是要换一种状态 还是等价替换掉原先想的状态。

我们可以来分析一下，若 d 一开始等于 1，每次都加一，即 d + (d + 1） + (d + 2) …..x = 30000。得到 x 的值为 250 左右，也就说明 跳跃距离 与 原先 d 相比，变化量为 -250 ~ 250。所以原先的状态就可以等价转换为： $dp[i][j]$ (跳到坐标 i ，跳跃距离变化量为 j 时所能的到的最多砖石数量)。但数组标号不能为负数，所以我们可以把变化量整体往右移 250，也就是 0<= j <= 500，则跳跃距离变化量就可以用 j - 250 来表示了。


转移方程:见代码


代码如下:

#include<bits/stdc++.h>
using namespace std;

const int maxn = 3e4 + 5,mi = 500;
int cost[maxn + 5],dp[maxn + 5][mi];

int main(){
    int n,d,x,ma = 0;
    cin >> n >> d;
    for(int i = 1;i <= n;i++){
        cin >> x;
        cost[x]++;
    }
    memset(dp,-1,sizeof(dp));//初始化为 -1，若等于 -1 表示当前状态不存在。
    dp[d][250] = 0;
    for(int i = d;i <= maxn;i++){
        for(int j = 1;j <= mi;j++){
            if(dp[i][j] >= 0) dp[i][j] += cost[i];//大于等于 0 表示，当前状态存在。
            int l = j - 250 + d; 
            ma = max(ma,dp[i][j]);//在过程中取 max 得到答案。
            if(l > 0 && l + i <= maxn){
                dp[i + l][j] = max(dp[i + l][j],dp[i][j]);
                dp[i + l + 1][j + 1] = max(dp[i + l + 1][j + 1],dp[i][j]);
                ma = max(ma,max(dp[i + l][j],dp[i + l + 1][j + 1]));
                if(l > 1){//跳跃距离不能为 0。
                    dp[i + l - 1][j - 1] = max(dp[i + l - 1][j - 1],dp[i][j]);
                    ma = max(ma,dp[i + l - 1][j - 1]);
                }
            }
        }
    }
    cout << ma << endl;
}