题目链接:http://acm.hdu.edu.cn/showproblem.php?pid=2571
思路:DP自左向右,由上至下更新就好。
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
#include<cmath>
#include<string>
#include<queue>
#define N 1111
#define INF 0x3f3f3f3f
using namespace std;
int f[N][N];
int g[N][N];
int main()
{
int T;
scanf("%d",&T);
while(T--)
{
int n,m,i,j,k;
scanf("%d%d",&n,&m);
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
scanf("%d",&g[i][j]);
f[i][j]=-INF;
}
}
f[1][1]=g[1][1]; //start~~
for(i=1;i<=n;i++)
{
for(j=1;j<=m;j++)
{
f[i][j+1]=max(f[i][j]+g[i][j+1],f[i][j+1]); // (x,y+1)
for(k=2;k*j<=m;k++)
{
f[i][j*k]=max(f[i][j*k],g[i][j*k]+f[i][j]); // (x,y*k)
}
if(i+1<=n) f[i+1][j]=f[i][j]+g[i+1][j]; //(x+1,y)
}
}
printf("%d\n",f[n][m]); //end~~
}
return 0;
}