Problem Description
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
代码:
//记忆化搜索 + dp 思想
//记忆化搜索:
//就斐波拉切数列来说明:
//首先前提: f[max] = {0};
//直接递归:
//int f(int n){
// if( n <= 2)
// return 1;
// else
// return f(n-1) + f(n-2);
//}
//若使用记忆化搜索,此时需要增加一个数组来记录已经求解过的f(n):
//int f(int n){
// if(f[n] != 0) //表明该f(n)已经求解过了
// return fn[n];
// if( n <= 2)
// return 1;
// else
// return f(n-1) + f(n-2);
//}
//很明显该算法 以空间换取了时间 ,当 n 很大时 , 记忆化搜索的效率要高很多。
//
//
#include <stdio.h>
#include <cstring>
using namespace std;
int n , k;
int dp[101][101];
int value[101][101];
int dir[4][2] = {1,0 , 0,-1 , -1,0 , 0,1}; //代表方向 右、下、左、上
int boundary(int x , int y){
if(x >= 0 && y >= 0 && x < n && y < n)
return 1;
return 0;
}
int dfs(int x , int y){
int i , j , x1 , y1 , temp = 0 , max = 0;
if(dp[x][y] != 0)
return dp[x][y];
for(i = 0 ; i < 4 ; i ++)
for( j = 0 ; j < k ; j ++){
x1 = x + dir[i][0] * j ;
y1 = y + dir[i][1] * j ;
if(boundary(x1 , y1) && value[x1][y1] > value[x][y]){ //未超过边界 , 并且下一跳的cheese > 当前的
temp = dfs(x1 , y1);
if(temp > max)
max = temp;
}
}
dp[x][y] = value[x][y] + max;
return dp[x][y];
}
int main(){
int i , j ;
while(scanf("%d %d",&n ,&k) != EOF){
memset(dp , 0 , sizeof(dp));
memset(value , 0 , sizeof(value));
if(n == -1 && k == -1)
break;
for(i = 0 ; i < n ; i ++)
for( j = 0 ; j < n ; j ++)
scanf("%d" , value[i][j]);
printf("%d\n",dfs(0 ,0 ));
}
return 0;
}