Advertisement
Not a member of Pastebin yet?
Sign Up,
it unlocks many cool features!
- #include <iostream>
- #include <vector>
- using namespace std;
- int n, m;
- vector<vector<int>> matrix;
- vector<vector<int>> dp;
- int dx[] = {-1, 0, 1, 0};
- int dy[] = {0, 1, 0, -1};
- bool is_valid(int x, int y) {
- return x >= 0 && x < n && y >= 0 && y < m;
- }
- int dfs(int x, int y) {
- if (dp[x][y] != 1) {
- return dp[x][y];
- }
- for (int i = 0; i < 4; i++) {
- int nx = x + dx[i], ny = y + dy[i];
- if (is_valid(nx, ny) && matrix[nx][ny] > matrix[x][y]) {
- dp[x][y] = max(dp[x][y], 1 + dfs(nx, ny));
- }
- }
- return dp[x][y];
- }
- int main() {
- cin >> n >> m;
- matrix.resize(n, vector<int>(m));
- dp.resize(n, vector<int>(m, 1));
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- cin >> matrix[i][j];
- }
- }
- int max_result = 0;
- for (int i = 0; i < n; i++) {
- for (int j = 0; j < m; j++) {
- max_result = max(max_result, dfs(i, j));
- }
- }
- cout << max_result << endl;
- return 0;
- }
Advertisement
Add Comment
Please, Sign In to add comment
Advertisement