HDU1078:FatMouse and Cheese(记忆化)
来源:互联网 发布:php注册登录 编辑:程序博客网 时间:2024/05/29 12:53
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.
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.
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
题意:
老鼠每次只能走k步停下来,停下的这个位置只能比上一个停留的位置大,并获取其价值,每次只能水平或垂直走,问最大能得到的价值,用DP数组记忆从当前位置出发能得到的最大value
#include <cstdio>#include <cstdlib>#include <string.h>#include <string>#include <math.h>#include <algorithm>#include <iostream>#include <queue>#include <stack>#include <map>#include <set>using namespace std;int i,j,n,k;int a[110][110], dp[110][110];const int dir[4][2]={0,-1,0,1,1,0,-1,0};int dfs(int x, int y){if(dp[x][y]!=-1)return dp[x][y];int ii,jj,xx,yy,ret=a[x][y];// if stop here(meaning not go to for-loop), we get a[x][y]for(ii=0;ii<4;ii++)for(jj=1;jj<=k;jj++){xx=x+jj*dir[ii][0];yy=y+jj*dir[ii][1];if(xx<0||yy<0||xx>=n||yy>=n||a[x][y]>=a[xx][yy])continue; // no need to mark visited or notret=max(ret,dfs(xx,yy)+a[x][y]);}dp[x][y]=ret;return ret;}int main(){ while(cin>>n>>k && n!=-1 && k!=-1) { for(i=0;i<n;i++) for(j=0;j<n;j++) cin>>a[i][j]; memset(dp, -1, sizeof(dp)); cout<<dfs(0,0)<<endl; } return 0;}
阅读全文
0 0
- hdu1078 FatMouse and Cheese(记忆化搜索)
- HDU1078:FatMouse and Cheese(记忆化)
- HDU1078 FatMouse and Cheese 【记忆化搜索】
- hdu1078 FatMouse and Cheese 记忆化搜索
- HDU1078 FatMouse and Cheese记忆化搜索
- hdu1078 fatmouse and cheese 记忆化搜索
- hdu1078 FatMouse and Cheese【记忆化搜索】
- HDU1078:FatMouse and Cheese(记忆化)
- hdu1078 FatMouse and Cheese(记忆化搜索)
- hdu1078+FatMouse and Cheese+DFS+记忆化搜索
- HDU1078 FatMouse and Cheese [记忆化搜索DFS]
- hdu1078 FatMouse and Cheese(记忆化搜索)
- HDU1078 FatMouse and Cheese(DFS记忆化搜索)
- hdu1078 FatMouse and Cheese —— 记忆化搜索
- HDU1078:FatMouse and Cheese(记忆化 dp+搜索) (P)
- HDU1078 FatMouse and Cheese DP(记忆化搜索)
- hdu1078 FatMouse and Cheese
- hdu1078 FatMouse and Cheese
- 自定义拦截器的两种写法
- linux解决文件读写权限的设置问题
- SpringMVC 多层嵌套的数据接收与展现
- 【敏捷】敏捷理论
- Android 自定义RecyclerView实现滑行选择日期
- HDU1078:FatMouse and Cheese(记忆化)
- Apache Hadoop 3.0.0 GA版正式发布,可以部署到线上
- 【Servlet】【ajax】分页显示
- Android onStartCommand返回值问题
- ajax api 动态查询全国天气信息
- iOS crash报告分析
- springboot配置随机数
- Android开发环境配置
- python处理某些文件夹下的csv文件,提取指定行到新文件中