FatMouse and Cheese 记忆化搜索模板

关于 FatMouse and Cheese
FatMouse has stored some cheese in a city. The city can be considered as a square grid of dimension n: each grid location is labelled (p,q) where 0 <= p < n and 0 <= q < n. At each grid location Fatmouse has hid between 0 and 100 blocks of cheese in a hole. Now he’s going to enjoy his favorite food.

FatMouse begins by standing at location (0,0). He eats up the cheese where he stands and then runs either horizontally or vertically to another location. The problem is that there is a super Cat named Top Killer sitting near his hole, so each time he can run at most k locations to get into the hole before being caught by Top Killer. What is worse – after eating up the cheese at one location, FatMouse gets fatter. So in order to gain enough energy for his next run, he has to run to a location which have more blocks of cheese than those that were at the current hole.

Given n, k, and the number of blocks of cheese at each grid location, compute the maximum amount of cheese FatMouse can eat before being unable to move.
Input
There are several test cases. Each test case consists of

a line containing two integers between 1 and 100: n and k
n lines, each with n numbers: the first line contains the number of blocks of cheese at locations (0,0) (0,1) … (0,n-1); the next line contains the number of blocks of cheese at locations (1,0), (1,1), … (1,n-1), and so on.
The input ends with a pair of -1’s.
Output
For each test case output in a line the single integer giving the number of blocks of cheese collected.
Sample Input
3 1
1 2 5
10 11 6
12 12 7
-1 -1
Sample Output
37
这道题的思路，因为每次要保证下一次大于上一次，且可以朝四个方向走，所以可以定义一个（4，2）的数组，来表示行走的方向，可以用记忆化搜索来做，如果有重复走的步骤便比较现在的路线与之前路线的大小，然后返回，然后依次这样递推，直到走不动为止。

#include<cstdio>
#include <iostream>
#include<algorithm>
#include<cstring>
using namespace std;
int n,k;
int dx[]={1,0,-1,0};
int dy[]={0,-1,0,1};//初始打表表示行走的方向
int c[105][105],dp[105][105];
int dfs(int x,int y)
{
    int m=0;
    int i,j,a,b;
    for(i=1;i<=k;i++)//四种行走情况
    {
        for(j=0;j<4;j++)
        {
             a=x+dx[j]*i;
             b=y+dy[j]*i;//位置
            if(a<0||b<0||a>=n||b>=n)
            continue;//越界则结束本次循环
            if(c[x][y]>=c[a][b])
                continue;//因为要保证行走的下一步大于上次，所以当下一步小时，则结束本次循环
            if(dp[a][b])
            {
                m=max(m,dp[a][b]);//如果这一步已经走过，比较现在路径值大，还是之前到这个位置值大，取大的那个路径值，最后得到的则为最大的路径值
                continue;
            }
            m=max(m,dfs(a,b));//递推下去，a,b，即为新的x,y，重新出发，即为直到走完，即循环完
        }
    }
    return dp[x][y]=m+c[x][y];//加上出发点，输出
}
int main()
{
    while(scanf("%d%d",&n,&k)!=EOF&&n!=-1&&k!=-1)
    {
        int i,j;
        for(i=0;i<n;i++)
        {
            for(j=0;j<n;j++)
            {
                scanf("%d",&c[i][j]);
            }
        }
        memset(dp,0,sizeof(dp));
        dfs(0,0);
        printf("%d\n",dp[0][0]);
    }
}