#include #include #include using namespace std; int n; vector pan; int dx[] = {-1, 1, 0, 0}; int dy[] = {0, 0, -1, 1}; int res = 0; extern vector move_up(vector v); extern vector move_down(vector v); extern vector move_right(vector v); extern vector move_left(vector v); void dfs(int L, vector v) { if (L == 5) { for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) res = max(res, v[i][j]); retu..