HDU 1078 FatMouse and Cheese(记忆化)

原创 2016年08月30日 11:03:55

Question:
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.
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.
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
题目大意:一只老鼠每次只能水平或者垂直最多走k步,且要求每次停留的位置都比上次大,并且获得停留处的值,问能取得的最大值
解题思路:这是一道记忆化搜索题
(http://acm.hust.edu.cn/vjudge/contest/125402#problem/K)

#include <iostream>
#include <cstdio>
#include <cstring>
using namespace std;
int n,k,dp[105][105],a[105][105];
int dfs(int i,int j)
{
    if(dp[i][j])
        return dp[i][j];
    int l=j-k,r=j+k,u=i-k,d=i+k;
    l=l<0?0:l;   //判断其边界
    r=r>n-1?n-1:r;
    u=u<0?0:u;
    d=d>n-1?n-1:d;
    int MAX=0;
    for(int p=l;p<=r;p++)  //一个一个dfs
    {
        if(a[i][j]<a[i][p])  //判断是否停留位置比原位置大
            MAX=max(MAX,dfs(i,p));
    }
    for(int p=u;p<=d;p++)
    {
        if(a[i][j]<a[p][j])
            MAX=max(MAX,dfs(p,j));
    }
    dp[i][j]=MAX+a[i][j];
    return dp[i][j];
}
int main()
{
    while(~scanf("%d%d",&n,&k))
    {
        if(n==-1&&k==-1)
            break;
        memset(dp,0,sizeof(dp));
        memset(a,0,sizeof(a));
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
                scanf("%d",&a[i][j]);
        printf("%d\n",dfs(0,0));
    }
}

体会:记忆化省时,挺好用的

版权声明:本文为博主原创文章,未经博主允许不得转载。

FatMouse and Cheese_hdu_1078(记忆化搜索).java

FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Oth...

FatMouse and Cheese (hdu 1078 记忆化搜索)

题意:给出n*n的数字矩阵,从(0,0)出发,走的下一步格子上的数要大于当前格子上的数,并且每次可以沿直线前进最多k个位置,也就是每次有4*k个选择,问最后所有数之和的最大值。 思路:记忆化搜索。...

暑期dp46道(19)HDU 1078 FatMouse and Cheese dfs+记忆化搜索

题目链接:HDOJ 1078 题意:给定一个n*n的矩阵,从(1,1)点出发,且每次只能经过比当前点大的点,每次上下左右方向都可以选择但是不能越界,并且每次最大行走距离为m,经过每一点都能获取...
  • ADjky
  • ADjky
  • 2016年08月10日 14:45
  • 262

每日三题-Day5-C(HDU 1078 FatMouse and Cheese 记忆化搜索)

FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others...

hdu 1078 fatmouse and cheese 记忆化搜索

FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others...

HDU 1078 FatMouse and Cheese 记忆化搜索模板 dp

FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/Oth...

【记忆化搜索】HDU-1078 FatMouse and Cheese

FatMouse and Cheese Time Limit: 2000/1000 MS (Java/Others)    Memory Limit: 65536/32768 K (Java/O...

HDU 1078 FatMouse and Cheese【第一道记忆化搜索题】

第一次做记忆化搜索的问题 查找了网上的资料 参考了网上对记忆化搜索的解释  1.记忆化搜索的思想     记忆化搜索的思想是,在搜索过程中,会有很多重复计算,如果我们能记录一些状态的答案,就可以...

hdu 1078 FatMouse and Cheese dfs 记忆化搜素

代码: #include #include #include #include #include #include #include #include #include using...

HDU 1078 FatMouse and Cheese 记忆化搜索

题意:在N∗NN*N的矩阵里找一个递增的权值最大的链,问这个权值是多少?思路:记忆化搜索,我开始也是蠢,直接搜,然而发现有太多状态都是重复的,还妄想借助流氓剪枝过,我要忏悔。 http://acm...
  • NMfloat
  • NMfloat
  • 2015年12月16日 20:50
  • 231
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:HDU 1078 FatMouse and Cheese(记忆化)
举报原因:
原因补充:

(最多只允许输入30个字)