Problem Descption
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
问题链接:http://acm.hdu.edu.cn/showproblem.php?pid=1078
问题分析:搜索题,但是没有目标,试了DFS和BFS一个会TL一个会ML,首先要注意的一点是,如果没有条件的搜索,那就是枚举。只有搜遍了才能得到最后的解。所以为节省搜索时间需要利用DP+DFS,即记忆化搜索;
第一遇到的值得纪念
#include<iostream>
#include<stdio.h>
#include<algorithm>
#include<cstring>
using namespace std;
int dp[110][110];//记录(x,y)点能到达的点的集合中的最大值
int map[110][110];
int dir[4][2] = { 1,0,0,1,-1,0,0,-1 };
int n, k;
int dfs(int x, int y)
{
if (dp[x][y])//如果已经搜索过返回原来的值(记忆化搜索的关键)
{
return dp[x][y];
}
int sum = 0;//只是用来调用函数
for(int i=1;i<=k;i++)
for (int j = 0; j < 4; j++)
{
int tx = x + dir[j][0] * i;
int ty = y + dir[j][1] * i;
if (tx > n - 1 || ty > n - 1 || tx < 0 || ty < 0 || map[x][y] >= map[tx][ty])continue;
sum = max(sum, dfs(tx, ty));//max((x,y)这点能到达的点的集合中的最大值)
}
return dp[x][y] = sum + map[x][y];//返回(x,y)集合能到达点中的最大值同时加上当前位置的值
}
int main()
{
while (scanf("%d%d", &n, &k) != EOF)
{
if (n == -1 && k == -1)break;
for (int i = 0; i < n; i++)
for (int j = 0; j < n; j++)scanf("%d", &map[i][j]);
memset(dp, 0, sizeof(dp));
cout << dfs(0, 0) << endl;
}
}