[BAEKJOON] 1937 욕심쟁이 판다

#define _CRT_SECURE_NO_WARNINGS #include <iostream> #include <vector> #include <algorithm> using namespace std; int n; vector<vector<int>>map(501, vector<int>(501)), DP(501, vector<int>(501, -1)); int eating(int x, int y) { int&ret = DP[x][y]; if (ret != -1) return ret; int num1 = 0, num2 = 0, num3 = 0, num4 = 0; if (x + 1 < n && map[x + 1][y] > map[x][y]) num1 = eating(x + 1, y); if (y + 1 < n && map[x][y + 1] > map[x][y]) num2 = eating(x, y + 1); if (x - 1 >= 0 && map[x - 1][y] > map[x][y]) num3 = eating(x - 1, y); if (y - 1 >= 0 && map[x][y - 1] > map[x][y]) num4 = eating(x, y - 1); return ret = max(max(num1, num2), max(num3, num4)) + 1; } int main() { scanf("%d", &n); for (int x = 0; x < n; x++) for (int y = 0; y < n; y++) scanf("%d", &map[x][y]); int Max = 0; for (int x = 0; x < n; x++) for (int y = 0; y < n; y++) Max = max(Max, eating(x, y)); printf("%d", Max); return 0; }