hdu 1078 fatmouse and cheese 记忆化搜索

原创 2012年03月26日 06:33:17

FatMouse and Cheese

Time Limit: 2000/1000 MS (Java/Others) Memory Limit: 65536/32768 K (Java/Others)
Total Submission(s): 2394 Accepted Submission(s): 913


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.

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步也必须走直线,即
“He eats up the cheese where he stands and then
runs either horizontally or vertically to another location. ”
不过是多加个循环罢了
*/
#include<stdio.h>
#include<string.h>
#define N 101
#define max(a,b) (a)>(b)?(a):(b)
int n,k,maze[N][N],ch[N][N];
int move[][2]={0,1,1,0,0,-1,-1,0};
bool ok(int x,int y)
{
    return (x>=0&&x<n&&y>=0&&y<n);
}
int dfs(int x,int y)
{
    if(ch[x][y])
        return ch[x][y];
    int i,j,a,b;
    int num=0;
    for(i=1;i<=k;++i)
    {
        for(j=0;j<4;++j)
        {
            a=x+move[j][0]*i;
            b=y+move[j][1]*i;
            if(ok(a,b)&&maze[a][b]>maze[x][y])
                num=max(num,dfs(a,b));
        }
    }
    return ch[x][y]=num+maze[x][y];
}
int main()
{
    while(scanf("%d%d",&n,&k)==2&&(n!=-1))
    {
        int i,j;
        for(i=0;i<n;++i)
            for(j=0;j<n;++j)
                scanf("%d",&maze[i][j]);
        memset(ch,0,sizeof(ch));
        dfs(0,0);
        int sum=0;
        for(i=0;i<n;++i)
            for(j=0;j<n;++j)
                sum=max(sum,ch[i][j]);
        printf("%d\n",sum);
    }
    return 0;
}


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

相关文章推荐

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

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

hdu 1078 FatMouse and Cheese 记忆化搜索/动态规划

题意:n*n的矩阵,一只老鼠从(0,0)点出发,每次只能水平或竖直行走不超过k步,且停留位置奶酪的值必须大于前一位置,求老鼠最多能吃多少奶酪。 这题可以用记忆化搜索做,很容易。也可以根据奶酪多少排序...

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

一道比较直白的记忆化搜索的题目。 题目中的k表示横向或者竖直可以前进的距离,不能够拐弯。老鼠的出发点是(1,1)。 对于老鼠从当前点能够到达的点,筛选出从这些点到达当前点所能获得的cheese的最大值...

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

Problem Description FatMouse has stored some cheese in a city. The city can be considered as a squa...

HDU - 1078 FatMouse and Cheese (记忆化搜索)

HDU - 1078 FatMouse and Cheese FatMouse has stored some cheese in a city. The city can be considered...

HDU1078 FatMouse and Cheese(DFS记忆化搜索)

题意:在n*n的地图上,每个格子都有若干奶酪,老鼠从(0,0)出发,每次只能朝一个方向运动1到k次,且到达的下一个格子奶酪一定要比这个多,求最多能吃到的奶酪数。 思路:dfs即可,由于还要枚...

!HDU 1078 FatMouse and Cheese-dp-(记忆化搜索)

题意:有一个n*n的格子,每个格子里有不同数量的食物,老鼠从(0,0)开始走,每次下一步只能走到比当前格子食物多的格子,有水平和垂直四个方向,每一步最多走k格,求老鼠能吃到的最多的食物。 分析: ...

HDU 1078 FatMouse and Cheese 记忆化搜索

题意:在N∗NN*N的矩阵里找一个递增的权值最大的链,问这个权值是多少?思路:记忆化搜索,我开始也是蠢,直接搜,然而发现有太多状态都是重复的,还妄想借助流氓剪枝过,我要忏悔。 http://acm...

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

题目链接:[kuangbin带你飞]专题十二 基础DP1 P - FatMouse and Cheese题意 给n*n地图,老鼠初始位置在(0,0),它每次行走要么横着走要么竖着走,每次最多可以走...

hdu1078 FatMouse and Cheese(记忆化搜索)

记忆化搜索
内容举报
返回顶部
收藏助手
不良信息举报
您举报文章:深度学习:神经网络中的前向传播和反向传播算法推导
举报原因:
原因补充:

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