BZOJ 1270
其实和BZOJ 4745 蛮像的
一开始就想到了 dp[i][j] 代表 i 高度 第 j 棵 树的答案
然后很容易想到 n^3 的暴力做法
但是其实因为你从 i + del
你只要找到那层最大的跳下来就行 这样我们取一个 f 数组记录每层的最大值
然后跳下来并更新即可
/*
if you can't see the repay
Why not just work step by step
rubbish is relaxed
to ljq
*/
#include <cstdio>
#include <cstring>
#include <iostream>
#include <queue>
#include <cmath>
#include <map>
#include <stack>
#include <set>
#include <sstream>
#include <vector>
#include <stdlib.h>
#include <algorithm>
using namespace std;
#define dbg(x) cout<<#x<<" = "<< (x)<< endl
#define dbg2(x1,x2) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<endl
#define dbg3(x1,x2,x3) cout<<#x1<<" = "<<x1<<" "<<#x2<<" = "<<x2<<" "<<#x3<<" = "<<x3<<endl
#define max3(a,b,c) max(a,max(b,c))
#define min3(a,b,c) min(a,min(b,c))
#define lc (rt<<1)
#define rc (rt<<11)
#define mid ((l+r)>>1)
typedef pair<int,int> pll;
typedef long long ll;
const int inf = 0x3f3f3f3f;
const int _inf = 0xc0c0c0c0;
const ll INF = 0x3f3f3f3f3f3f3f3f;
const ll _INF = 0xc0c0c0c0c0c0c0c0;
const ll mod = (int)1e9+7;
ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
ll ksm(ll a,ll b,ll mod){int ans=1;while(b){if(b&1) ans=(ans*a)%mod;a=(a*a)%mod;b>>=1;}return ans;}
ll inv2(ll a,ll mod){return ksm(a,mod-2,mod);}
void exgcd(ll a,ll b,ll &x,ll &y,ll &d){if(!b) {d = a;x = 1;y=0;}else{exgcd(b,a%b,y,x,d);y-=x*(a/b);}}//printf("%lld*a + %lld*b = %lld\n", x, y, d);
const int MAX_N = 2025;
int N[MAX_N],tree[MAX_N][MAX_N],dp[MAX_N][MAX_N],f[MAX_N];
int main()
{
//ios::sync_with_stdio(false);
//freopen("a.txt","r",stdin);
//freopen("b.txt","w",stdout);
int ans = 0,n,H,del,d;scanf("%d%d%d",&n,&H,&del);
for(int i = 1;i<=n;++i)
{
scanf("%d",&N[i]);
for(int j = 1;j<=N[i];++j)
{
scanf("%d",&d);
tree[i][d]++;
}
}
for(int i = H;i>=1;--i)
for(int j = 1;j<=n;++j)
{
if(i+del<=H) dp[i][j] = max(dp[i+1][j],f[i+del]);
else if(i<H) dp[i][j] = dp[i+1][j];
else dp[i][j] = 0;
dp[i][j] += tree[j][i];
f[i] = max(dp[i][j],f[i]);
}
printf("%d\n",f[1]);
//fclose(stdin);
//fclose(stdout);
//cout << "time: " << (long long)clock() * 1000 / CLOCKS_PER_SEC << " ms" << endl;
return 0;
}