HDU 1078 FatMouse and Cheese (老鼠吃奶酪)
来源:互联网 发布:网络教研方法 编辑:程序博客网 时间:2024/06/09 15:33
FatMouse and Cheese
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 4671 Accepted Submission(s): 1877
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
37
题意:在n*n的方阵中,每个格子里面放着一定的奶酪,老鼠每次只能在水平或竖直方向走k步,而且每次必须走到奶酪数比当前多的格子,求最多可以吃多少奶酪。
AC代码:
#include <stdio.h>#include <string.h>#define max(a,b) a>b?a:b;//author:YangSirint mp[150][150],dp[150][150],n,k;int dfs(int x,int y)//记忆化搜索{int sum=0,i;if(dp[x][y])//记住路径return dp[x][y];for(i=1;i<=k;i++){if(x+i<n&&mp[x+i][y]>mp[x][y])sum=max(sum,dfs(x+i,y));if(y+i<n&&mp[x][y+i]>mp[x][y])sum=max(sum,dfs(x,y+i));if(x-i>=0&&mp[x-i][y]>mp[x][y])sum=max(sum,dfs(x-i,y));if(y-i>=0&&mp[x][y-i]>mp[x][y])sum=max(sum,dfs(x,y-i));}return dp[x][y]=sum+mp[x][y];}int main(){int i,j;while(~scanf("%d%d",&n,&k)){if(n==-1&&k==-1) break;memset(mp,0,sizeof(mp));memset(dp,0,sizeof(dp));for(i=0;i<n;i++)for(j=0;j<n;j++)scanf("%d",&mp[i][j]);printf("%d\n",dfs(0,0));}return 0;}
0 0
- HDU 1078 FatMouse and Cheese (老鼠吃奶酪)
- HDU 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- hdu-1078-FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- Hdu 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- hdu 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- HDU 1078 FatMouse and Cheese
- Java学习总结12——IO
- Java - Socket连接池
- cJSON很好使用的一个json解析器
- mac OS X 10.9.3 上emacs 24.1 org-mode8.26 利用beamer 输出中文ppt
- MFC对话框应用程序添加自定义消息
- HDU 1078 FatMouse and Cheese (老鼠吃奶酪)
- 如何高效学习
- 语言的歧义
- temp post, delete soon
- POJ-3253 Fence Repair
- C#调用C++DLL 数据类型转换
- Base64编码解码C语言实现
- 安卓学习日志之开启新的activity获取他的返回值
- 【iOS】Web Color 的 Swift 实现