过了第2个点却只有40分的蒟蒻求助......

#include<iostream>
#include<cstdio>
using namespace std;
long long a[110][110],x,y,s=1,xx,yy;
int h[5]={-1,0,0,1},l[5]={0,-1,1,0},maxn=0;
int hsm()
{
	int m,n;
	long long big=0;
	for(int k=0;k<4;k++)
	{
		m=x+h[k];
		n=y+l[k];
		if(m<=0||n<=0) continue;
		if((a[m][n]>big)&&(a[m][n]<a[x][y]))
		{
			big=a[m][n];
			xx=m;
			yy=n;
		}
	}
	if(big==0) return 0;
	s++;
	x=xx;
	y=yy;
	return hsm();
}
int main()
{
	int r,c;
	cin>>r>>c;
	for(int i=1;i<=r;i++)
	{
		for(int j=1;j<=c;j++)
		{
			cin>>a[i][j];
			if(a[i][j]>maxn) 
			{
				maxn=a[i][j];
				x=i;
				y=j;
			}
		}
	}
	hsm();
	cout<<s;
    return 0;
}