【求调】70pts，#5 #6 #7

#include<bits/stdc++.h>
using namespace std;
int n , m , a[105][105] , dp[105][105];
struct swe{
	int i , j , num;
	bool operator ()(const swe &a , const swe &b) const{
		return a.num > b.num;
	}
};
priority_queue<swe , vector<swe> , swe> q_dp;
int main(){
	cin >> n >> m;
	for(int i = 1;i <= n;i ++){
		for(int j = 1;j <= m ;j++){
			cin >> a[i][j];	
			swe test = {i , j , a[i][j]};
			q_dp.push(test);
		}
	}
	while(!q_dp.empty()){
		swe test = q_dp.top();
		int i = test.i;
		int j = test.j;
		q_dp.pop();
		dp[i][j] = max(max(dp[i][j] , 1), max(dp[i - 1][j] + 1 , max(dp[i + 1][j] + 1 , max(dp[i][j - 1] + 1, dp[i][j + 1] + 1))));
	}
	int maxn = 0;
	for(int i = 1;i <= n;i ++){
		for(int j = 1;j <= m ;j++){
			maxn = max(maxn , dp[i][j]);
		}
	}
	cout << maxn;
	return 0;
}