/*
很水的dp,不过中间竟然把一个变量写错了,wa了好多次,纠结啊~~
*/
#include <stdio.h>
#include <string.h>
const int inf=~0U>>1;
inline int max(int a, int b)
{
return a > b ? a : b;
}
int main()
{
int f[22][1002], temp, t, n, m;
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &n, &m);
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
f[i][j] = -inf;
f[1][1] = 0;
for(int i=1; i<=n; i++)
for(int j=1; j<=m; j++)
{
scanf("%d", &temp);
f[i][j] += temp;
f[i+1][j] = max(f[i+1][j], f[i][j]);
f[i][j+1] = max(f[i][j+1], f[i][j]);
for(int k=2; j*k <= m; k++)//刚开始把m写成n,错了好多次的有木有~~~!!!!
f[i][j*k] = max(f[i][j*k], f[i][j]);
}
printf("%d\n", f[n][m]);
}
return 0;
}
hdoj 2571 命运 【DP】【水】
最新推荐文章于 2018-09-08 11:04:35 发布