ZOJ-1107-FatMouse and Cheese-dfs+记忆化搜索

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 Specification

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 Specification

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

Output for Sample Input

37

题意：给出一个n和k，代表一个n*n的矩阵，k代表老鼠每一次水平或者垂直走的最多步数，-1-1输入结束

没写出来的原因：

1. 对于记忆化搜索理解不够透彻，这一题不需要对于走过的点进行标记。每次走到之前走过的那个位置，直接返回那个位置所对应的奶酪数，因为那个点所找的奶酪数肯定是之前找过的并且是最多的。
2. 对于每次可以走1、2、...k步不知道可以在控制方向那边再用一层循环去进行控制。

 #include<stdio.h>
 #include<iostream>
 #include<cmath>
 #include<string.h>
 #include<iomanip>
 using namespace std;

 int n,k;
 int dir[][]= {{,},{,-},{-,},{,}};
 int a[][];
 int ss[][];//存每一步能够得到的最大奶酪数，之后要是访问过就直接返回

 int dfs(int x,int y)
 {
     if(ss[x][y])
         return ss[x][y];
     else
     {
         for(int i=; i<; i++)
         {
             for(int j=; j<=k; j++)
             {
                 int tx=x+dir[i][]*j;
                 int ty=y+dir[i][]*j;
              //   if(tx>=0&&tx<n&&ty>=0&&ty<n&&ss[x][y]==0)//WA//之前这个点可能是已经记录过步数的，因为要通过两层循环去控制每次的步数和方向，然后去寻找这个点的最大值进行更新
               if(tx>=&&tx<n&&ty>=&&ty<n)
                 {
                     if(a[tx][ty]>a[x][y])
                     {
                         int maxx=dfs(tx,ty);
                         if(maxx>ss[x][y])
                         {
                             ss[x][y]=maxx;
                         }
                     }
                 }
             }
         }
         ss[x][y]=ss[x][y]+a[x][y];
         return ss[x][y];
     }
 }
 int main()
 {
     std::ios::sync_with_stdio(false);
     cin.tie();
     cout.tie();
     while(cin>>n>>k)
     {
         memset(a,,sizeof(a));
         memset(ss,,sizeof(ss));
         if(n==-&&k==-)
             break;
         for(int i=; i<n; i++)
         {
             for(int j=; j<n; j++)
             {
                 cin>>a[i][j];
             }
         }
         cout<<dfs(,)<<endl;
     }
     return ;
 }