HOJ 2571 命运

这里可以理解为将一维的数据分成了几行就容易了

#include<iostream>
#include<cstring>
#define max(a, b) a > b ? a : b
#define INF -99999999
using namespace std;
const int NN = 1005;
int num[21][NN], dp[21][NN];

int main() {
	int c, n, m;
	cin >> c;
	while (c--) {
		cin >> n >> m;
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++) {
				cin >> num[i][j];
				dp[i][j] = INF;
			}
		for (int i = 1; i <= n; i++)
			for (int j = 1; j <= m; j++) {
				if (i - 1 > 0) dp[i][j] = max(dp[i][j], dp[i - 1][j]);
				if (j - 1 > 0) dp[i][j] = max(dp[i][j], dp[i][j - 1]);
				for (int k = 1; k < j; k++)
					if (j % k == 0)
						dp[i][j] = max(dp[i][j], dp[i][k]);
				if (dp[i][j] < -9000000) dp[i][j] = 0;
				dp[i][j] += num[i][j];
			}
		cout << dp[n][m] << endl;
	}
	return 0;
}