HDU1078(深搜+DP)
来源:互联网 发布:手机上的数据处理软件 编辑:程序博客网 时间:2024/05/01 00:20
FatMouse and Cheese
Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)Total Submission(s): 3515 Accepted Submission(s): 1390
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
#include <iostream>#include <cstdio>#include <cstdlib>#include <cstring>using namespace std;int n,k,dp[101][101],map[101][101];int DFS(int x,int y){ int i; if(dp[x][y])//dp[i][j]表示从点i,j处开始能获得的最多cheese; return dp[x][y]; dp[x][y]=map[x][y]; for(i=1;i<=k;i++) { if(x+i<n&&map[x+i][y]>map[x][y]) dp[x][y]=max(dp[x][y],DFS(x+i,y)+map[x][y]); if(x-i>=0&&map[x-i][y]>map[x][y]) dp[x][y]=max(dp[x][y],DFS(x-i,y)+map[x][y]); if(y+i<n&&map[x][y+i]>map[x][y]) dp[x][y]=max(dp[x][y],DFS(x,y+i)+map[x][y]); if(y-i>=0&&map[x][y-i]>map[x][y]) dp[x][y]=max(dp[x][y],DFS(x,y-i)+map[x][y]); } return dp[x][y];}int main(){ while(cin>>n>>k) { if(n==-1&&k==-1) break; for(int i=0;i<n;i++) { for(int j=0;j<n;j++) { cin>>map[i][j]; } } memset(dp,0,sizeof(dp)); cout<<DFS(0,0)<<endl; } return 0;}/*测试数据及答案:Sample Input:3 11 2 510 11 612 12 7-1 -1Sample Output:37*/
- HDU1078(深搜+DP)
- HDU1078:记忆搜索(dp+dfs)
- HDU1078 FatMouse and Cheese(DFS+DP)
- HDU1078 FatMouse and Cheese(DP&非DP)
- HDU1078(树形DP+DFS)
- hdu1078基础dp
- HDU1078 dfs+dp
- hdu1078(dp+dfs)
- HDU1078:FatMouse and Cheese(记忆化 dp+搜索) (P)
- HDU1078 FatMouse and Cheese DP(记忆化搜索)
- HDU1078 记忆化DFS+dp
- hdu1078
- hdu1078
- hdu1078
- HDU1078
- HDU1078
- hdu1078
- HDU1078
- 也说_T、_TEXT、TEXT、L
- C#互操作的内存溢出问题
- hdu 3646 Fate Stay Night
- HDU1102Constructing Roads(MST)
- shell script: pattern match (模式识别)
- HDU1078(深搜+DP)
- 互联网的三大巨头 百度 阿里巴巴 腾讯(BAT)
- TabHost简单使用
- 通过eclipse查看Android源代码(Java)
- 生成20个1-100不重复的随机数
- sysu宿舍网络路由器分享——IPv6篇
- 链表翻转、左旋转字符串
- Fragment详解(一)--->核心基础以及Fragment与Activity传递数据完整示例
- HDU2532 && BNU6657:Engine(模拟)