hdoj1078FatMouse and Cheess【记忆化搜索】
来源:互联网 发布:网络摄像头哪个牌子好 编辑:程序博客网 时间:2024/05/21 17:17
FatMouse and Cheese
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 7770 Accepted Submission(s): 3217
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
#include<iostream>#include<cstdio> #include<cstdlib>#include<cstring>#include<algorithm>#include<cmath>#include<queue>#include<list>#include<vector>using namespace std;const int maxn=110;int n,m,k;int map[maxn][maxn];int dp[maxn][maxn];int mov[][2]={0,1,0,-1,1,0,-1,0};int dfs(int x,int y){ if(dp[x][y])return dp[x][y]; for(int i=1;i<=k;++i){ for(int j=0;j<4;++j){ int xx=x+mov[j][0]*i; int yy=y+mov[j][1]*i; if(xx>=1&&xx<=n&&yy>=1&&yy<=n&&map[xx][yy]>map[x][y]){ dp[x][y]=max(dp[x][y],dfs(xx,yy)+map[xx][yy]); } } } return dp[x][y];}int main(){ int i,j; while(scanf("%d%d",&n,&k),n!=-1||k!=-1){ for(i=1;i<=n;++i){ for(j=1;j<=n;++j){ scanf("%d",&map[i][j]); } } memset(dp,0,sizeof(dp)); printf("%d\n",dfs(1,1)+map[1][1]); } return 0;}
0 0
- hdoj1078FatMouse and Cheess【记忆化搜索】
- zoj1107FatMouse and Cheese (记忆化搜索)
- FatMouse and Cheese_hdu_1078(记忆化搜索).java
- hdu1078 FatMouse and Cheese(记忆化搜索)
- HDU1078 FatMouse and Cheese 【记忆化搜索】
- HDU1078_FatMouse and Cheese【记忆化搜索】
- hdoj1078 FatMouse and Cheese【记忆化搜索】
- hdu1078 FatMouse and Cheese 记忆化搜索
- HDU1078 FatMouse and Cheese记忆化搜索
- hdu1078FatMouse and Cheese【记忆化搜索】
- hdu1078_FatMouse and Cheese记忆化搜索
- hdoj1078 FatMouse and Cheese(记忆化搜索)
- zoj1107FatMouse and Cheese 记忆化搜索
- FatMouse and Cheese(记忆化搜索)
- hdu1078 fatmouse and cheese 记忆化搜索
- hdu1078 FatMouse and Cheese【记忆化搜索】
- 记忆化搜索:HDU1078-FatMouse and Cheese(记忆化搜索)
- hdu 1078 fatmouse and cheese 记忆化搜索
- hdoj1025Constructing Roads In JGShining's Kingdom【LIS】
- 我的第一个嵌入式linux驱动(基于韦东山led驱动)
- [linux]查看端口号占用情况
- IOS学习 绘图 UIBezierPath 绘基本图形、样式设置、渲染填充
- 运算器的特殊实现方法
- hdoj1078FatMouse and Cheess【记忆化搜索】
- 深度优先搜索DFS
- Hamx安装失败的问题
- C++虚函数
- Qt 16进制字符串跟QByteArray互转
- java数据类型划分
- 1042 - Secret Origins
- centos 安装php
- SAM数据格式学习3之官方文档