- 摘花生问题
w
- 2025-5-17 11:50:41 @
#include <bits/stdc++.h> using namespace std; const int MAXN = 100; int grid[MAXN][MAXN]; int dp[MAXN][MAXN]; int main() { int m, n; cin >> m >> n; for (int i = 0; i < m; ++i) { for (int j = 0; j < n; ++j) { cin >> grid[i][j]; } } dp[0][0] = grid[0][0]; for (int j = 1; j < n; ++j) { dp[0][j] = dp[0][j-1] + grid[0][j]; } for (int i = 1; i < m; ++i) { dp[i][0] = dp[i-1][0] + grid[i][0]; } for (int i = 1; i < m; ++i) { for (int j = 1; j < n; ++j) { dp[i][j] = max(dp[i-1][j], dp[i][j-1]) + grid[i][j]; } } cout << dp[m-1][n-1] << endl;
return 0;
}
0 条评论
目前还没有评论...
信息
- ID
- 71
- 时间
- 1000ms
- 内存
- 256MiB
- 难度
- 7
- 标签
- 递交数
- 24
- 已通过
- 8
- 上传者