[DP] BZOJ 1270 [BeijingWc2008]雷涛的小猫

水题

#include<cstdio>
#include<cstdlib>
#include<algorithm>
using namespace std;

inline char nc(){
static char buf[100000],*p1=buf,*p2=buf;
if (p1==p2) { p2=(p1=buf)+fread(buf,1,100000,stdin); if (p1==p2) return EOF; }
return *p1++;
}

inline void read(int &x){
char c=nc(),b=1;
for (;!(c>='0' && c<='9');c=nc()) if (c=='-') b=-1;
for (x=0;c>='0' && c<='9';x=x*10+c-'0',c=nc()); x*=b;
}

const int N=5005;

int n,d,h;
int cnt

;
int f
,g
;

int main()
{
int x,y;
read(n); read(h); read(d);
for (int i=1;i<=n;i++)
{
read(x);
for (int j=1;j<=x;j++)
read(y),cnt[i][y]++;
}
for (int i=h;i;i--)
{
int tmp=i+d<=h?f[i+d]:0;
for (int j=1;j<=n;j++)
g[j]=max(g[j],tmp)+cnt[j][i],f[i]=max(f[i],g[j]);
}
printf("%d\n",f[1]);
return 0;
}