UVA-10285-Longest Run on a Snowboard

#include <iostream>
#include <memory.h>
#include <vector>
#include <map>
#include <algorithm>
#include <cstdio>
#include <math.h>
#include <queue>
#include <string>
#include <stack>
#include <iterator>
#include <stdlib.h>
#include <time.h>
#include <assert.h>

using namespace std;
typedef long long LL;

const int MAXN = 100 + 10;
int Next[4][2] = {{-1, 0}, {0, 1}, {1, 0}, {0, -1}};
int Map[MAXN][MAXN];
int dp[MAXN][MAXN];
int r, c;

int Dfs(int x, int y)
{
    if (dp[x][y] != -1)
        return dp[x][y];
    dp[x][y] = 0;
    for (int i = 0;i < 4;i++)
    {
        int tx = x + Next[i][0];
        int ty = y + Next[i][1];
        if (tx < 1 || tx > r || ty < 1 || ty > c)
            continue;
        if (Map[x][y] <= Map[tx][ty])
            continue;
        dp[x][y] = max(dp[x][y], Dfs(tx ,ty));
    }
    return ++dp[x][y];
}

int main()
{
    int t;
    cin >> t;
    while (t--)
    {
        string name;
        cin >> name >> r >> c;
        for (int i = 1;i <= r;i++)
            for (int j = 1;j <= c;j++)
                cin >> Map[i][j];
        memset(dp, -1, sizeof(dp));
        int res = -1;
        for (int i = 1;i <= r;i++)
        {
            for (int j = 1;j <= c;j++)
                res = max(res, Dfs(i, j));
        }
        cout << name << ": " << res << endl;
    }

    return 0;
}