HDU 1078(搜索)
来源:互联网 发布:jsp时间轴数据库读取 编辑:程序博客网 时间:2024/05/16 23:52
FatMouse and Cheese
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 9388 Accepted Submission(s): 3962
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 11 2 510 11 612 12 7-1 -1
Sample Output
37using namespace std;typedef long long ll;ll dp[105][105],a[105][105];ll n,k;int dx[4]={0,0,1,-1},dy[4]={1,-1,0,0};//这道题是不能斜着走的int dfs(int x,int y){ if(dp[x][y]) return dp[x][y];//如果是dfs过的就直接return减少时间 ll ans=0,sum=0; for(int i=0;i<4;i++) for(int h=1;h<=k;h++) { int nx=x+h*dx[i],ny=y+h*dy[i]; if(0<=nx&&nx<n&&0<=ny&&ny<n&&a[nx][ny]>a[x][y]) { int tmp=dfs(nx,ny); if(ans<tmp) ans=tmp; } } dp[x][y]=ans+a[x][y]; return dp[x][y];}int main(){ while(cin>>n>>k&&n!=-1&&k!=-1) { for(int i=0;i<n;i++) for(int j=0;j<n;j++) { cin>>a[i][j]; dp[i][j]=0;//顺便全部初始化为0,便于后面dfs中判断 } cout<<dfs(0,0)<<endl; }}
0 0
- HDU 1078(搜索)
- hdu 1078 (dp记忆化搜索)
- hdu 1078(记忆化搜索)
- hdu 1078(记忆化搜索)
- hdu 1078 搜索
- HDU 1078 DP + 记忆搜索
- hdu 1078记忆化搜索
- DFS+记忆搜索-HDU-1078
- hdu 1078 记忆化搜索
- HDU 1078 记忆化搜索
- hdu 1078 记忆化搜索
- (1078)HDU-记忆化搜索
- hdu 1078 记忆化搜索
- HDU 1078 记忆化搜索
- hdu 1078 记忆化搜索
- hdu 1078 (记忆化搜索)
- hdu 1078 记忆化搜索
- hdu 1078 记忆化搜索
- UDP协议疑难杂症全景解析
- MySQL命令行导出导入数据库
- 安卓判断系统相机授权状态以及调用系统相机
- tomcat、apache、nginx之间的关系
- css之vertical-align
- HDU 1078(搜索)
- Tiled2Unity2D使用
- 功能强大的编辑器——Vi
- hdoj 3400 Line belt (三分嵌套搜索 )
- 版本管理+微建站+头条号接入-Zoomla!逐浪CMS2 x3.9.0发布
- Linux下Makefile的自动生成步骤
- Linux系统平均负载3个数字的含义
- IOS基础学习之C(二)
- 第二章 solr数据库mysql更新数据