HDU 2571 命运

题目分析

#include <cstdio>
#include <cstring>
#include <iostream>
#include <algorithm>
using namespace std;
const int INF = 0x3f3f3f3f;

int maze[25][1005];
int dp[25][1005];

int main()
{
int C;
scanf("%d", &C);
while(C--){
int n,m;
scanf("%d%d", &n, &m);
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
scanf("%d", &maze[i][j]);
for(int i = 0; i < 25; i++)
for(int j = 0; j < 1005; j++)
dp[i][j] = -INF;
dp[1][1] = maze[1][1];
for(int i = 1; i <= n; i++)
{
for(int j = 1; j <= m; j++)
{
dp[i+1][j] = max(dp[i][j] + maze[i+1][j], dp[i+1][j]);
dp[i][j+1] = max(dp[i][j] + maze[i][j+1], dp[i][j+1]);
for(int k = 2; k*j <= m; k++)
dp[i][k*j] = max(dp[i][j] + maze[i][k*j], dp[i][k*j]);
}
}
printf("%d\n", dp
[m]);
}
return 0;
}