1078FatMouse and Cheese
来源:互联网 发布:网络推广部门口号 编辑:程序博客网 时间:2024/05/29 15:42
FatMouse and Cheese
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 5669 Accepted Submission(s): 2302
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
第一思路dp,判断是否map是否大于左边和上边的数,然后去最大的dp+该点map,与该点dp取最大值,错误思路以为还有可能从右和下过来是四个方向,然后还是抄了题解的DFS。还有dfs还得注意不能全部搜索否则超时
#include <iostream>#include<cstdio>#include<cstring>using namespace std;int dp[1000][1000];int map[1000][1000];int main(){ int n,k; while(scanf("%d%d",&n,&k)!=EOF&&(n!=-1||k!=-1)) { memset(map,0,sizeof(map)); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) scanf("%d",&map[i][j]); memset(dp,0,sizeof(dp)); for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) { if(map[i][j]>map[i-1][j]) dp[i][j]=max(dp[i][j],dp[i-1][j]+map[i][j]); if(map[i][j]>map[i][j-1]) dp[i][j]=max(dp[i][j],dp[i][j-1]+map[i][j]); if(map[i][j]>map[i][j+1]) dp[i][j]=max(dp[i][j],dp[i][j+1]+map[i][j]); if(map[i][j]>map[i+1][j]) dp[i][j]=max(dp[i][j],dp[i+1][j]+map[i][j]); } for(int i=1;i<=n;i++) { for(int j=1;j<=n;j++) cout<<dp[i][j]<<" "; cout<<endl; } int maxn=0; for(int i=1;i<=n;i++) for(int j=1;j<=n;j++) if(dp[i][j]>maxn) maxn=dp[i][j]; printf("%d\n",maxn); } return 0;}
#include <iostream>#include<cstdio>#include<cstring>#include<algorithm>using namespace std;int map[105][105],sum[105][105];int n,k;int go[4][2]={{1,0},{-1,0},{0,1},{0,-1}};int dfs(int x,int y){ int l,maxn=0; if(sum[x][y]) return sum[x][y];//是否访问过,缺少这个就超时 for(int i=0;i<=4;i++) { for(int j=1;j<=k;j++) { int fx=x+go[i][0]*j; int fy=y+go[i][1]*j; if(fx>=0&&fy>=0&&fx<n&&fy<n) { if(map[fx][fy]>map[x][y]) { l=dfs(fx,fy); maxn=max(l,maxn); } } } } sum[x][y]=maxn+map[x][y]; return sum[x][y];}int main(){ while(scanf("%d%d",&n,&k)!=EOF&&(n!=-1||k!=-1)) { int ss; for(int i=0;i<n;i++) for(int j=0;j<n;j++) scanf("%d",&map[i][j]); memset(sum,0,sizeof(sum)); ss=dfs(0,0); printf("%d\n",ss); } return 0;}
0 0
- 1078FatMouse and Cheese
- hdoj 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
- HDOJ 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
- HDOJ 1078 FatMouse and Cheese
- 《Effective java》读书笔记——过期引用
- lua gc
- CF #301 504C C. Ice Cave BFS
- 利用enum实现swtich String类型
- ruby+nokogori抓取糗事百科前10頁並存儲進資料庫示例
- 1078FatMouse and Cheese
- Ruby字元串、條件、循環、數組、Hash、類基本操作筆記
- 傻瓜教程:把iPhone程序连接真机调试
- H.图像匹配(安徽省2014年“京胜杯”大学生程序设计竞赛)
- Ruby中的反射(Reflection)應用實例
- 2840: 编程题AB-面粉质量差
- Linux下利用script命令录制并回放终端会话
- vs2010 单文档MFC 通过加载位图文件作为客户区背景
- 解析 ruby 全局變數