[BOJ 1937] 욕심쟁이 판다

BOJ :: 백준 :: 1937 :: 욕심쟁이 판다

출처 : https://www.acmicpc.net/problem/1937

#include <iostream>

#include <algorithm>

using namespace std;

int N, ans;

int map[501][501], dp[501][501];

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

inline bool check(int i, int j) { return ((i >= 0 && j >= 0 && i < N && j < N) ? true : false); }

int dfs(int i, int j) {

if (dp[i][j]) return dp[i][j];

dp[i][j] = 1;

for (int d = 0; d < 4; d++) {

int ni = i + dir[d][0]; int nj = j + dir[d][1];

if (check(ni, nj) && map[i][j] < map[ni][nj]) dp[i][j] = max(dp[i][j], dfs(ni, nj) + 1);

}

return dp[i][j];

}

int main() {

std::ios::sync_with_stdio(false);

cin >> N; ans = 0;

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++) ans = max(ans, dfs(i, j));

cout << ans << endl;

return 0;

}