hdu2571 命运

简单的模拟即可。

AC代码：

#include <cstdio>
#include <cstring>
#include <iostream>
#define INF -0x3f3f3f3f
using namespace std;
int dp[1005][1005],map[1005][1005];
int max(int x,int y)
{
    return x > y?x:y;
}
int main()
{
    int t;
    while(~scanf("%d",&t))
    {
        while(t--)
        {
            memset(dp,INF,sizeof(dp));
            int n,m;
            scanf("%d%d",&n,&m);
            for(int i = 1; i <= n; i++)
                for(int j = 1; j <= m; j++)
                 scanf("%d",&map[i][j]);
            dp[1][1] = map[1][1];
            for(int i = 1; i <= n; i++)
            {
                for(int j = 1; j <= m; j++)
                {
                    dp[i+1][j] = max(dp[i][j]+map[i+1][j],dp[i+1][j]);
                    dp[i][j+1] = max(dp[i][j]+map[i][j+1],dp[i][j+1]);
                    for(int k = 2; k*j<=m; k++)
                    {
                        dp[i][k*j] = max(dp[i][j]+map[i][k*j],dp[i][k*j]);
                    }
                }
            }
            /*for(int i = 1; i <= n; i++)
            {
                for(int j = 1; j <= m; j++)
                    printf("%d ",dp[i][j]);
                printf("\n");
            }*/
            printf("%d\n",dp[n][m]);
        }
    }
    return 0;
}