关闭

HDU 1078 FatMouse and Cheese(记忆化)

标签: 算法ACM
108人阅读 评论(0) 收藏 举报
分类:

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));
    }
}

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

0
0

查看评论
* 以上用户言论只代表其个人观点,不代表CSDN网站的观点或立场
    个人资料
    • 访问:4254次
    • 积分:611
    • 等级:
    • 排名:千里之外
    • 原创:60篇
    • 转载:0篇
    • 译文:0篇
    • 评论:0条
    文章分类