• 2024-09-09记忆化搜索一例
    洛谷P1434。本题边界处理很有趣#include<bits/stdc++.h>usingnamespacestd;intf[101][101];intn[102][102];intr,c;intsear(intn0,intm0){if(n0==0||m0==0)return0;if(n0==r+1||m0==c+1)return0;if(f[n0][m0]!=-1)returnf[n0][m0];//intmax=