HDOJ 题目1078 FatMouse and Cheese(记忆化搜索+DP)
来源:互联网 发布:菜鸟网络是做什么的 编辑:程序博客网 时间:2024/05/17 09:28
FatMouse and Cheese
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 6627 Accepted Submission(s): 2725
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
Source
Zhejiang University Training Contest 2001
Recommend
We have carefully selected several similar problems for you: 1080 1074 1158 1227 1502
ac代码
#include<stdio.h>#include<string.h>#define LL __int64int dir[4][2]={{0,1},{1,0},{0,-1},{-1,0}};int n,k;LL map[1010][1010],dp[1010][1010];int jud(int x,int y){if(x>=1&&x<=n&&y>=1&&y<=n)return 1;return 0;}LL dfs(int x,int y){int i,j;int temp=0;if(dp[x][y])return dp[x][y];for(i=0;i<4;i++){for(j=1;j<=k;j++){int xx=x+dir[i][0]*j;int yy=y+dir[i][1]*j;if(jud(xx,yy)&&map[xx][yy]>map[x][y]){LL tmp=dfs(xx,yy);if(temp<tmp)temp=tmp;}}}dp[x][y]=temp+map[x][y];return dp[x][y];}int main(){//int n,k;while(scanf("%d%d",&n,&k)!=EOF,n!=-1||k!=-1){int i,j;for(i=1;i<=n;i++){for(j=1;j<=n;j++)scanf("%I64dd",&map[i][j]);}memset(dp,0,sizeof(dp));printf("%I64d\n",dfs(1,1));}}
0 0
- HDOJ 题目1078 FatMouse and Cheese(记忆化搜索+DP)
- hdoj 1078 FatMouse and Cheese(记忆化搜索)
- hdu(1078) FatMouse and Cheese (记忆化搜索+dp)
- !HDU 1078 FatMouse and Cheese-dp-(记忆化搜索)
- HDOJ 1078 FatMouse and Cheese(记忆化搜索)
- hdoj 1078 fatmouse and cheese 记忆化搜索
- HDOJ 1078 FatMouse and Cheese 记忆化搜索模板
- hdu 题目1078FatMouse and Cheese(记忆搜索)
- hdu 1078 FatMouse and Cheese(dp 记忆化搜索)
- HDU 1078 FatMouse and Cheese 简单DP&记忆化搜索
- HDU 1078 FatMouse and Cheese 记忆化搜索模板 dp
- [HDU 1078 ] FatMouse and Cheese [ dp 记忆化搜索 ]
- HDU FatMouse and Cheese (记忆化搜索+dp思想)
- FatMouse and Cheese (DFS + DP 记忆化搜索)
- HDU1078:FatMouse and Cheese(记忆化 dp+搜索) (P)
- HDU1078 FatMouse and Cheese DP(记忆化搜索)
- hdu-1078 FatMouse and Cheese (and) 滑雪问题(记忆化搜索+简单dp)
- hdu-1078 FatMouse and Cheese (and) 滑雪问题(记忆化搜索+简单dp)
- JavaWeb开发环境搭建Eclipse配置Tomcat
- html5 canvas绘制路径
- “互联网+”并不神秘,就是提高效率
- 转载:通过Java API编程实现Nutch Crawler抓取数据存储到MySQL数据库
- 注解@PostConstruct与@PreDestroy讲解及实例
- HDOJ 题目1078 FatMouse and Cheese(记忆化搜索+DP)
- leetcode 42 Trapping Rain Water
- 改变单个制图表达属性
- Java拿到工程的绝对路径相关问题-maven-resources-plugin
- Android中关于Adapter的使用(中)SimpleAdapter
- 通过代码控制ListView上下滚动
- B-树、B+树、B*树
- MySQL 字段字符串截取常用的一个小技巧
- 数组指针与指针数组