Bila

#include <bits/stdc++.h>
using namespace std;

ifstream fin("bila.in");
ofstream fout("bila.out");

int a[25][25],r[21][21],n,m,maxim;

bool valid(int lc, int cc, int val)
{
    if(lc >= 1 && lc <= n && cc >= 1 && cc <= m )
    {
        return val > a[lc][cc];
    }
    return 0;
}
bool solutie(int lc, int cc)
{
    return lc == 1 || lc == n || cc == 1 || cc == m;
}
void prelucrare_sol(int lc, int cc)
{
    if(r[lc][cc] > maxim)
    {
        maxim = r[lc][cc];
    }

}
void backt(int lc, int cc)
{
    int dl[4] = {-1,0,1,0};
    int dc[4] = {0,1,0,-1};

    for(int k=0; k<4; k++)
    {
        int val = a[lc][cc];

        lc = dl[k] + lc;
        cc = dc[k] + cc;

        if(valid(lc, cc, val))
        {
            r[lc][cc] = r[lc - dl[k]][cc - dc[k]] + 1;

            if(solutie(lc,cc))
                prelucrare_sol(lc,cc);

            else
                backt(lc, cc);
        }

        lc = lc - dl[k];
        cc = cc - dc[k];
    }
}
int main()
{
    int i_start,j_start;
    fin>>n>>m;
    for(int i=1; i<=n; i++)
    {
        for(int j=1; j<=m; j++)
        {
            fin>>a[i][j];
        }
    }
    fin>>i_start>>j_start;

    r[i_start][j_start]=1;

    backt(i_start, j_start);

    fout<<maxim<<'\n';

}