Longest Run on a Snowboard

#include <map>
#include <set>
#include <list>
#include <cmath>
#include <queue>
#include <stack>
#include <cstdio>
#include <vector>
#include <string>
#include <cctype>
#include <complex>
#include <cassert>
#include <utility>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>
using namespace std;
typedef pair<int,int> PII;
typedef long long ll;
#define lson l,m,rt<<1
#define pi acos(-1.0)
#define rson m+1,r,rt<<11
#define All 1,N,1
#define read freopen("in.txt", "r", stdin)
const ll  INFll = 0x3f3f3f3f3f3f3f3fLL;
const int INF= 0x7ffffff;
const int mod =  1000000007;
int dp[110][110],mapc[110][110];
int n,m;
int dir[4][2]={{0,1},{0,-1},{1,0},{-1,0}};
int dfs(int x,int y){
    int f=0;
    if(dp[x][y]!=-1)return dp[x][y];
    int tmp=-1;
    for(int i=0;i<4;++i){
        int xx=x+dir[i][0];
        int yy=y+dir[i][1];
        if(xx>=0&&xx<n&&yy>=0&&yy<m&&mapc[xx][yy]<mapc[x][y]){
        tmp=max(tmp,dfs(xx,yy)+1);
        f=1;
        }
    }
    if(!f)tmp=1;
    return dp[x][y]=tmp;
}
int main()
{
    string s;
    int t;
    scanf("%d",&t);
    while(t--){
        cin>>s;
        scanf("%d%d",&n,&m);
        for(int i=0;i<n;++i)
        for(int j=0;j<m;++j)
        scanf("%d",&mapc[i][j]);
        memset(dp,-1,sizeof(dp));
        int maxn=-1;
        for(int i=0;i<n;++i)
            for(int j=0;j<m;++j)
            maxn=max(maxn,dfs(i,j));
        cout<<s<<": ";
        printf("%d\n",maxn);
    }
return 0;
}