HDOJ 1078 FatMouse and Cheese 记忆化搜索模板

#include<cstdio>
#include<cstring>
#include<algorithm>
using namespace std;
int dp[200][200],mp[200][200],n,k,bu[4][2] = {0,1,0,-1,1,0,-1,0};
bool can(int x,int y)
{
if(x>=0&&x<n&&y>=0&&y<n)return true;
else return false;
}
int dfs(int x,int y)
{
if(dp[x][y])return dp[x][y];
int count = 0;
for(int j=0;j<4;j++)
for(int i=1;i<=k;i++)
{
int X = x+bu[j][0]*i,Y = y+bu[j][1]*i;
if(!can(X,Y))break;
if(mp[X][Y]>mp[x][y])
{
count = max(count,dfs(X,Y));
}
}
return dp[x][y] = mp[x][y]+count;
}
int main()
{
while(scanf("%d%d",&n,&k)!=EOF)
{
if(n==-1&&k==-1)break;
memset(dp,0,sizeof(dp));
for(int i=0;i<n;i++)
for(int j=0;j<n;j++)
scanf("%d",&mp[i][j]);
printf("%d\n",dfs(0,0));
}
return 0;
}