(dp)HDU - 1078 FatMouse and Cheese

48 篇文章 0 订阅
7 篇文章 0 订阅

题意:这题题意就是给你一个网格,你在(0,0)开始走,每步可以向上或向下或向左或向右走最多k步,且每次走到的位置的值都要比上次大,问走到的位置值和最大是多少

思路:这题有两种做法,一种是记忆化搜索,一种是直接dp,直接dp就是把每个点排序,然后类似最长上升子序列那样dp,不过n^2的做法会超时 不要问我为什么知道会超时,得优化一下(怎么优化很简单,我就不写了 其实是懒得写,hdu讨论区有人发了代码),记忆化搜索就很简单了,每次向四个方向搜一遍,纪录最大值就好了

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

 

#include<stdio.h>
#include<iostream>
#include<math.h>
#include<algorithm>
#include<cstring>
#define maxn 105
const int inf=0x7ffffff;
using namespace std;
#include<string>
int dp[maxn][maxn],mp[maxn][maxn];int n,k;
void dfs(int x,int y,int num)
{
    for(int i=max(1,x-k);i<=min(n,x+k);i++)
    {
        if(mp[i][y]>num&&dp[i][y]<dp[x][y]+mp[i][y])
        {
            dp[i][y]=dp[x][y]+mp[i][y];
            dfs(i,y,mp[i][y]);
        }
    }
    for(int i=max(1,y-k);i<=min(n,y+k);i++)
    {
        if(mp[x][i]>num&&dp[x][i]<dp[x][y]+mp[x][i])
        {
            dp[x][i]=dp[x][y]+mp[x][i];
            dfs(x,i,mp[x][i]);
        }
    }
}
int main()
{
    while(scanf("%d %d",&n,&k)!=EOF&&n!=-1&&k!=-1)
    {
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                scanf("%d",&mp[i][j]);
            }
        }
        memset(dp,0,sizeof(dp));
        dp[1][1]=mp[1][1];
        dfs(1,1,mp[1][1]);
        int ans=0;
        for(int i=1;i<=n;i++)
        {
            for(int j=1;j<=n;j++)
            {
                ans=max(dp[i][j],ans);
            }
        }
        printf("%d\n",ans);
    }
}

 

  • 1
    点赞
  • 1
    收藏
    觉得还不错? 一键收藏
  • 0
    评论
评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值