hdoj 1078 FatMouse and Cheese(记忆化搜索)
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.
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.
简单的记忆化搜索,和其他不一样的地方就是这个一次可以走K步,其他没啥!!
#include <iostream> #include <string.h> #include <stdio.h> using namespace std; int n, k, dp[101][101]; int map[101][101]; int dfs(int a,int b) { if(dp[a][b]) return dp[a][b]; dp[a][b] = map[a][b]; for(int i = 1;i <= k; i++) { if(a+i < n && map[a+i][b]>map[a][b]) dp[a][b] = max(dp[a][b],dfs(a+i,b)+map[a][b]); if(a-i >= 0 && map[a-i][b]>map[a][b]) dp[a][b] = max(dp[a][b],dfs(a-i,b)+map[a][b]); if(b-i >= 0 && map[a][b-i]>map[a][b]) dp[a][b] = max(dp[a][b],dfs(a,b-i)+map[a][b]); if(b+i < n && map[a][b+i]>map[a][b]) dp[a][b] = max(dp[a][b],dfs(a,b+i)+map[a][b]); } return dp[a][b]; } 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)); printf("%d\n",dfs(0,0)); } }
【推荐】编程新体验,更懂你的AI,立即体验豆包MarsCode编程助手
【推荐】凌霞软件回馈社区,博客园 & 1Panel & Halo 联合会员上线
【推荐】抖音旗下AI助手豆包,你的智能百科全书,全免费不限次数
【推荐】轻量又高性能的 SSH 工具 IShell:AI 加持,快人一步