50pts wa dp玄关

#include<bits/stdc++.h>
using namespace std;
int n,m,ma;
int a[105][105];
struct asd{
	int x;
	int y;
	int dp;
}f[100005];
int main(){
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	for(int t=1;t<=m;t++){
		cin>>a[i][t];
		f[a[i][t]].x=i;
		f[a[i][t]].y=t;
		f[a[i][t]].dp=1;
	}
	for(int i=1;i<=n*m;i++){
		if(a[f[i].x+1][f[i].y]<i&&f[i].x+1<=n)f[i].dp=max(f[i].dp,f[a[f[i].x+1][f[i].y]].dp+1);
		if(a[f[i].x-1][f[i].y]<i&&f[i].x-1>=1)f[i].dp=max(f[i].dp,f[a[f[i].x-1][f[i].y]].dp+1);
		if(a[f[i].x][f[i].y+1]<i&&f[i].y+1<=m)f[i].dp=max(f[i].dp,f[a[f[i].x][f[i].y+1]].dp+1);
		if(a[f[i].x][f[i].y-1]<i&&f[i].y-1>=1)f[i].dp=max(f[i].dp,f[a[f[i].x][f[i].y-1]].dp+1);
		ma=max(ma,f[i].dp);
	}
	cout<<ma;
	
	
	
	return 0;
}