这可能是我最近没看题解自己写的第一个简单dp问题吧这个题目我也不知道我当时怎么想的,看着看着就有了方向,一开始我是这样想的dp[i][j]表示到达第i颗树高度为j时的最优解,那么转移方程就是dp[i][j]=max(dp[i][j+1],dp[k][j+delate])+a[i][j](a[i][j]表示第i颗树高度为j有多少柿子),然后我就想是不是用单调队列优化,结果写不出来,又仔细的想了一下dp[i][j]我只要找到他高度为j+delate时的最大值就好了,注意一下区间边界
#include<iostream>
#include<stdio.h>
#include<math.h>
#include<string.h>
#include<string>
#include<vector>
#include<queue>
#include<algorithm>
#include<deque>
#include<map>
#include<stdlib.h>
#include<set>
#include<iomanip>
#include<stack>
#define ll long long
#define ms(a,b) memset(a,b,sizeof(a))
#define lowbit(x) x & -x
#define fi first
#define ull unsigned long long
#define se second
#define lson (rt<<1)
#define rson (rt<<1|1)
#define endl "\n"
#define bug cout<<"----acac----"<<endl
#define IOS ios::sync_with_stdio(false), cin.tie(0),cout.tie(0)
using namespace std;
const int maxn = 2e3+10;
const int maxm = 1.5e5 + 50;
const double eps = 1e-10;
const double inf = 0x3f3f3f3f;
const ll lnf = 0x3f3f3f3f3f3f3f3f;
const int mod = 1e4 + 7;
const double pi = 3.141592653589;
int n, h, d;
int a[2005][5005], dp[2005][5005];
int ma[maxn];
int main()
{
scanf("%d%d%d", &n, &h, &d);
for (int i = 1; i <= n; i++)
{
int k;
scanf("%d", &k);
for (int j = 1; j <= k; j++)
{
int x;
scanf("%d", &x);
a[i][x]++;
}
}
for (int i = h; i >= 0; i--)
{
for (int j = 1; j <= n; j++)
{
if (i + d <= h)
{
dp[j][i] = max(dp[j][i + 1] + a[j][i], ma[i + d] + a[j][i]);
ma[i] = max(ma[i], dp[j][i]);
}
else
{
dp[j][i] = dp[j][i + 1] + a[j][i];
ma[i] = max(ma[i], dp[j][i]);
}
}
}
int ans = 0;
for (int i = 1; i <= n; i++)
{
ans = max(dp[i][0], ans);
}
printf("%d\n", ans);
return 0;
}