1270: [BeijingWc2008]雷涛的小猫
Time Limit: 50 Sec
Memory Limit: 162 MB
Submit: 1154
Solved: 576
1270: [BeijingWc2008]雷涛的小猫
Time Limit: 50 Sec
Memory Limit: 162 MB
Submit: 1154
Solved: 576
Description
![](http://www.lydsy.com/JudgeOnline/images/1270/1.jpg)
![](http://www.lydsy.com/JudgeOnline/images/1270/2.jpg)
Input
![](http://www.lydsy.com/JudgeOnline/images/1270/3.jpg)
Output
![](http://www.lydsy.com/JudgeOnline/images/1270/4.jpg)
Sample Input
3 10 2
3 1 4 10
6 3 5 9 7 8 9
5 4 5 3 6 9
3 1 4 10
6 3 5 9 7 8 9
5 4 5 3 6 9
Sample Output
8
HINT
题解:
很好想的一个DP,但是我们需要优化一下。因为对于每一行我们可以从1~n的所有h[now+dalta]转移过来,所以我们在对相同高度进行DP时,维护一个mx表示这行中dp值最大的就ok#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=2005;
int n,h,delta,mx[N],a[N][N],f[N][N],ans;
int main()
{
scanf("%d%d%d",&n,&h,&delta);
for(int i=1;i<=n;i++)
{
int o,x;
scanf("%d",&o);
for(int j=1;j<=o;j++)
{
scanf("%d",&x);
a[i][x]++;
}
}
for(int j=h;j>=1;j--)
for(int i=1;i<=n;i++)
{
f[i][j]=max(f[i][j+1],mx[j+delta])+a[i][j];
mx[j]=max(f[i][j],mx[j]);
}
for(int j=h;j>=1;j--)
for(int i=1;i<=n;i++)
ans=max(ans,f[i][j]);
printf("%d",ans);
}
#include<cmath>
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;
const int N=2005;
int n,h,delta,mx[N],a[N][N],f[N][N],ans;
int main()
{
scanf("%d%d%d",&n,&h,&delta);
for(int i=1;i<=n;i++)
{
int o,x;
scanf("%d",&o);
for(int j=1;j<=o;j++)
{
scanf("%d",&x);
a[i][x]++;
}
}
for(int j=h;j>=1;j--)
for(int i=1;i<=n;i++)
{
f[i][j]=max(f[i][j+1],mx[j+delta])+a[i][j];
mx[j]=max(f[i][j],mx[j]);
}
for(int j=h;j>=1;j--)
for(int i=1;i<=n;i++)
ans=max(ans,f[i][j]);
printf("%d",ans);
}