ZOJ 1107 FatMouse and Cheese
来源:互联网 发布:vb.net 编辑:程序博客网 时间:2024/05/17 23:23
ZOJ 1107 FatMouse and Cheese
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.
Input Specification
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.
Output Specification
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
Output for Sample Input
37
深搜+动态规划,另外需要记忆结果,否则会TLE的
每次老鼠可以向上下左右走k个长度,依次递归深搜就行了
#include<iostream>#include <algorithm>#include <cstdio>#include <string.h>#include <cstring>using namespace std;int dir[4][2]={{1, 0}, {-1, 0}, {0, 1}, {0, -1}};int dp[110][110], map[110][110], n, k; int fun(int x, int y) { int M = 0; if (dp[x][y]) return dp[x][y]; int nx, ny; for (int i = 0; i < 4; i++) { for(int j = 1; j <= k; j++) { nx = x + dir[i][0] * j; ny = y + dir[i][1] * j; if (nx < 0 || nx >= n || ny < 0 || ny >= n || map[x][y] >= map[nx][ny]) { continue; } dp[nx][ny] = fun(nx, ny); M = max(dp[nx][ny], M); } } return M + map[x][y]; }int main(){#ifndef ONLINE_JUDGE freopen("1.txt","r",stdin); #endif int i, j, M; while(~scanf("%d%d", &n, &k)) { if (n == -1 && k == -1) { break; } for (i = 0; i < n; i++) { for(j = 0; j < n; j++) { scanf("%d", &map[i][j]); } } memset(dp, 0, sizeof(dp)); printf("%d\n", fun(0, 0)); } return 0;}
- zoj 1107 FatMouse and Cheese
- zoj 1107 FatMouse and Cheese
- zoj 1107 FatMouse and Cheese
- ZOJ 1107 FatMouse and Cheese
- ZOJ 1107 FatMouse and Cheese
- hdu 1087 zoj 1107 FatMouse and Cheese
- ZOJ 1107 FatMouse and Cheese(记忆化搜索)
- zoj 1107 FatMouse and Cheese 逆向动态规划
- ZOJ 1107 FatMouse and Cheese(记忆化搜索)
- HDU 1107 FatMouse and Cheese
- Chapter06-FatMouse and Cheese(ZOJ 1107)(搜索记忆DP)
- hdu1078 FatMouse and Cheese
- FatMouse and Cheese
- hdu1078 FatMouse and Cheese
- FatMouse and Cheese
- 1078FatMouse and Cheese
- HDU1078 FatMouse and Cheese
- FatMouse and Cheese
- 堆内存里的各种奇怪填充值
- \jdk1.6.0_25\jre\lib\ext下添加jar包,如何添加到myeclipse的项目中
- NetBeans配置Xdebug 远程调试PHP
- Ubuntu下配置samba实现文件夹共享
- stl sort
- ZOJ 1107 FatMouse and Cheese
- 出现Unable to locate appropriate constructor on class解决方案
- poj 2386 Lake Counting 简单深搜
- Windows环境下msysgit安装git flow
- 关于自定义view使用,命名空间问题,记录而已
- Objective-C Copy的概念、入门和内存管理
- MySQL存储过程从另外两个表中取数据存整合其他数据保存在一张新的表里
- 经典算法---渊子赛马
- C语言 输入年月日判断是第几天