hdu 1078 FatMouse and Cheese
来源:互联网 发布:php ajax传值 编辑:程序博客网 时间:2024/05/22 12:33
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经典的记忆化搜索,自己太弱了,参考大神的解法。。AC代码#include<stdio.h>#include<string.h>int mp[110][110],dp[110][110];int n,k;int dx[4]={1,0,-1,0,};int dy[4]={0,1,0,-1};int dfs(int x,int y){ int sum=0,max=0; if(!dp[x][y]) { for(int i=1;i<=k;i++) { for(int j=0;j<4;j++) { int xx=x+dx[j]*i; int yy=y+dy[j]*i; if(xx>=0&&xx<n&&yy>=0&&yy<n&&mp[xx][yy]>mp[x][y]) { sum=dfs(xx,yy); if(sum>max) max=sum; } } dp[x][y]=max+mp[x][y]; } } return dp[x][y];}int main(){ //freopen("in.txt","r",stdin); while(scanf("%d %d",&n,&k)!=EOF) { if(n==-1&&k==-1) break; memset(mp,0,sizeof(mp)); memset(dp,0,sizeof(dp)); for(int i=0;i<n;i++) for(int j=0;j<n;j++) scanf("%d",&mp[i][j]); int ans=dfs(0,0); printf("%d\n",ans); }}
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
- iOS多线程编程之Grand Central Dispatch(GCD)介绍和使用
- Paragon HFS+ – Windows下读取MACOS分区文件
- 数的计算
- PhotoShop中画圆角矩形最简单方法(图文并茂)!
- 再读《js高级程序设计》
- hdu 1078 FatMouse and Cheese
- ECMAScript5 Object的新属性方法
- Linux系统优化
- IOS侦测蓝牙是否开启
- 安卓学习笔记(三)分类排版说明——安卓第三天
- 12 个免费在线的 Web 网站性能测试工具
- dns
- 自定义Django的Decorators
- android监听home键