简单的动态规划,对于每一个位置a[ i ][ j ],从上一个可以到达该位置上的所以位置中找到一个最大值,加上该位置上的数即可。
AC代码:
#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int num[21][1005];
int dp[21][1005];
int main()
{
// freopen("8.txt", "r", stdin);
int t, m, n, i, j;
scanf("%d", &t);
while(t--)
{
scanf("%d%d", &n, &m);
memset(dp, 0, sizeof(dp));
for(i = 1; i <= n; i++)
for(j = 1; j <= m; j++)
scanf("%d", &num[i][j]);
dp[1][1] = num[1][1];
for(i = 1; i <= n; i++)
{
for(j = 1; j <= m; j++)
{
if(i - 1 >= 1)
{
int max = dp[i - 1][j];
int a, b;
for(a = 1; a < j; a++)
{
for(b = 2; b * a <= j; b++)
{
if(b * a == j && max < dp[i][a])
max = dp[i][a];
}
}
if(j - 1 >= 1 && max < dp[i][j - 1])
max = dp[i][j - 1];
dp[i][j] = max + num[i][j];
}
else if(j - 1 >= 1)
{
int max = dp[i][j - 1];
int a, b;
for(a = 1; a < j; a++)
{
for(b = 2; b * a <= j; b++)
{
if(b * a == j && max < dp[i][a])
max = dp[i][a];
}
}
dp[i][j] = max + num[i][j];
}
}
}
cout << dp[n][m] << endl;
}
return 0;
}