#include <iostream>
#include <cstring>
using namespace std;
int dp(int , int );
int a[25][25];
int d[25][25];
int m;
int n;
int main()
{
cin >> n >> m;
for(int i = 1; i <= n; i++)
for(int j = 1; j <= m; j++)
{
cin >> a[i][j];
}
memset(d, -1, sizeof(d));
cout << dp(1, 1) << endl;
}
int dp(int i, int j)
{
if(d[i][j] != -1)
return d[i][j];
d[i][j] = a[i][j];
if(i <= n && j <= m)
d[i][j] = (dp(i+1, j) > dp(i, j+1) ? dp(i+1, j) : dp(i, j+1)) + a[i][j];
return d[i][j];
}
南阳理工OJ_题目171 聪明的kk
最新推荐文章于 2022-01-22 21:49:04 发布