HDU--1078 -- FatMouse and Cheese [记忆搜索] [DFS]
2013-08-09 21:40
525 查看
FatMouse and Cheese
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 3705 Accepted Submission(s): 1471
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.
[align=left]Input[/align]
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
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
Sample Output
37
Code:
感谢 pp
#include"stdio.h" #include"string.h" int chee[110][110],vis[110][110],n,k; int move(int x,int y) { int i,j,temp,max; max=0; if(vis[x][y]) return vis[x][y];//改点计算过就可以直接返回~ for(i=1;i<=k;i++)//每一点都用1~k步走一遍,取最大的一个 { if(y+i<n && chee[x][y]<chee[x][y+i]) { temp = move(x,y+i); max = temp>max?temp:max; } if(x+i<n && chee[x][y]<chee[x+i][y]) { temp = move(x+i,y); max = temp>max?temp:max; } if(x-i>=0 && chee[x][y]<chee[x-i][y]) { temp = move(x-i,y); max = temp>max?temp:max; } if(y-i>=0 && chee[x][y]<chee[x][y-i]) { temp = move(x,y-i); max = temp>max?temp:max; } } vis[x][y] = chee[x][y] + max;//将最大的加到本身, return vis[x][y]; //返回改点的奶酪 } int main() { int i,j; while(scanf("%d%d",&n,&k),!(n==-1&&k==-1)) { for(i=0;i<n;i++) for(j=0;j<n;j++) scanf("%d",&chee[i][j]); memset(vis,0,sizeof(vis)); printf("%d\n",move(0,0));//从(0,0)开始 } }
相关文章推荐
- DFS+记忆搜索-HDU-1078
- HDU 1078 FatMouse and Cheese(记忆搜索)
- hdu——1078——FatMouse and Cheese:记忆化搜索
- HDU 1428 漫步校园 SPFA + DFS记忆搜索
- hdu 1078 FatMouse and Cheese dfs 记忆化搜素
- HDU——1078 Fatmouse and cheese(记忆搜索 + 动态规划)
- HDU 1078 DP + 记忆搜索
- hdu 1078 FatMouse and Cheese_记忆搜索
- hdu 1078 FatMouse and Cheese_记忆搜索
- HDU 1142 SPFA + DFS记忆搜索 学习了!!
- poj--1088--DFS(记忆化搜索之经典)
- HDU1045 Fire Net 暴力搜索DFS
- hdu 1078(dfs+dp)
- HDU 3699(J) ——A hard Aoshu Problem(DFS暴力搜索)
- HDU 3652 浅谈数位动态规划即记忆化搜索
- poj--1579--(DFS+记忆化搜索之经典)
- hdu 2610 Sequence one【搜索 dfs+剪枝】
- hdu 1181 (搜索BFS,深搜DFS,并查集)
- HDU 1258 Sum it up 搜索DFS
- HDU 4111 Alice and Bob (博弈[记忆话搜索])