1015. 摘花生（动态规划）

 

#include
using namespace std;
int mp[110][110];
int dp[110][110];
int t, m;
int main() {
	cin >> t;
	int r, c;
	while (t--) {
		cin >> r >> c;
		int i, j;
		memset(mp, 0, sizeof(mp));
		memset(dp, 0, sizeof(dp));
		for (i = 0; i < r; i++) {
			for (j = 0; j < c; j++) {
				cin >> mp[i][j];
			}
		}
		dp[0][0] = mp[0][0];
		for (i = 1; i < c; i++) {
			dp[0][i] = dp[0][i - 1] + mp[0][i];
		}
		for (i = 1; i < r; i++) {
			dp[i][0] = dp[i-1][0] + mp[i][0];
		}
		for (i = 1; i < r; i++) {
			for (j = 1; j < c; j++) {
				dp[i][j] = max(dp[i - 1][j], dp[i][j - 1]) + mp[i][j];
			}
		}
		cout << dp[r - 1][c - 1] << endl;
	}
}