[백준 1937: 욕심쟁이 판다] - C++

www.acmicpc.net/problem/1937

1937번: 욕심쟁이 판다

#include<iostream>
#include<string>
#include<string.h>
#include<algorithm>
using namespace std;

int n;
int map[501][501];
int dp[501][501];
int temp = -214000000;

int dir[4][2] = {
	{-1,0}
	,{0,1}
	,{1,0}
	,{0,-1}
};


int D(int _x, int _y)
{
	if (dp[_x][_y] != 0)
	{
		return dp[_x][_y];
	}

	dp[_x][_y] = 1;
	for (int i = 0; i < 4; i++)
	{
		int nextX = _x + dir[i][0];
		int nextY = _y + dir[i][1];

		if (nextX < 0 || nextY < 0 || n <= nextX || n <= nextY)
			continue;

		if (map[_x][_y] < map[nextX][nextY])
			dp[_x][_y] = max(dp[_x][_y], D(nextX, nextY) + 1);
	}

	return dp[_x][_y];

}



int main() {

	cin >> n;
	int result = -214000000;

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			cin >> map[i][j];

		}
	}

	for (int i = 0; i < n; i++)
	{
		for (int j = 0; j < n; j++)
		{
			temp = D(i, j);
			if (result < temp)
			{
				result = temp;
			}

		}
	}


	cout << result << endl;
	return 0;
}