滑雪---记忆化搜索

滑雪

记忆化搜索的函数，其返回值最好写成有返回值的 例如int

#include <cstring>
#include <iostream>
#include <algorithm>

using namespace std;

const int N = 310;

int n, m;
int g[N][N];
int f[N][N];

int dx[]= {0,1,-1,0},dy[]= {1,-1,0,0};

int dp(int x, int y)
{
	
	if (f[x][y] ) return f[x][y];

	int  t = 1;
	for (int i = 0; i < 4; i ++ )
	{
		int a = x + dx[i], b = y + dy[i];
		if (a >= 0 && a < n && b >= 0 && b < m && g[x][y] > g[a][b])
			t = max(t, dp(a, b) + 1);
	}
	f[x][y]=t;
	return t;
}

int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 0; i < n; i ++ )
		for (int j = 0; j < m; j ++ )
			scanf("%d", &g[i][j]);

	// memset(f, -1, sizeof f);

	int res = 0;
	for (int i = 0; i < n; i ++ )
		for (int j = 0; j < m; j ++ )
			res = max(res, dp(i, j));

	printf("%d\n", res);

	return 0;
}