调了半天没调出来，样例也没过

#include<iostream>
#include<iomanip>
#include<algorithm>
using namespace std;
int n, len, wid, map_[100][100] = { 0 };
int mox[10] = {0, 0,0,1,1,1,-1,-1,-1 };
int moy[10] = {0, 1,-1,0,1,-1,0,1,-1 };
int ans = 0;
void dfs(int x, int y, int val,int (&mark)[100][100])
{
     ans = max(ans, val);

    if (x > len or wid < y)
        return;
 
    if (x < len)
        dfs(x + 1, y, val, mark);
    else 
        dfs(1, y + 1, val, mark);

    for (int i = 0; i < 9; i++) {
        if(x + mox[i]>=1 and x + mox[i]<=len and y + moy[i]>=1 and y + moy[i]<=wid)
        if (mark[x + mox[i]][y + moy[i]] == 1)
            return;//周围有标记返回
    }
    
    for (int i = 0; i < 9; i++) {
        mark[x + mox[i]][y + moy[i]] = 1;
    }
    
    
    if (x < len)
        dfs(x + 1, y, val+map_[x][y], mark);
    else
        dfs(1, y + 1, val+map_[x][y], mark);
        
        
    for (int i = 0; i < 9; i++) {
        mark[x + mox[i]][y + moy[i]] = 0;
    }



}
int main()
{
    cin >> n;
    for (int i = 0; i < n; i++) {
        cin >> wid >> len;
        int mark[100][100] = { 0 };
        memset(map_, 0, sizeof(map_));
        for (int i = 1; i <= wid; i++){
            for (int j = 1; j <= len; j++) {
                cin >> map_[i][j];
            }
        }

        dfs(1, 1,0,mark);
        cout << ans << endl;
        ans = 0;
    }
}