Bila

#include <iostream>
#include <fstream>
#include <stdlib.h>

using namespace std;

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

int di[] = {-1, 0, 1, 0};
int dj[] = {0, -1, 0, 1};

int MAX = 0;

int n, m;
int iS, jS;
int a[21][21];

void backtr(int i, int j, int lungime = 1)
{
    if(i == n || i == 1 || j == m || j == m)
        MAX = max(MAX, lungime);
    else
    {
        for(int k = 0; k < 4; k++)
        {
            int nexti = i + di[k];
            int nextj = j + dj[k];

            if(a[i][j] > a[nexti][nextj])
                backtr(nexti, nextj, lungime + 1);
        }
    }
}

int main()
{
    fin >> n >> m;

    for(int i = 1; i <= n; i++)
        for(int j = 1; j <= m; j++)
            fin >> a[i][j];

    fin >> iS >> jS;

    backtr(iS, jS);

    fout << MAX;

    return 0;
}