FatMouse and Cheese HDU - 1078

题目链接: https://vjudge.net/contest/68966#problem/P
题面:
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.

题意: 从（0，0）开始，问每次能向四个方向之一最多移动k步，且移动到最后形成一串严格递增的序列，问这段序列之和最大为多少
思路: 记忆化搜索是从起点往外搜，DP是将权值排序后，进行DP
记忆化搜索 46ms

#include<bits/stdc++.h>
using namespace std;
const int N=100+5;
int n,k;
int mp[N][N];
int dp[N][N];
int dfs(int x,int y)
{
    if(dp[x][y])
        return dp[x][y];
    int ans,maxn=0;
    int l,r,d,u;
    l=max(0,x-k);
    r=min(n-1,x+k);
    d=min(n-1,y+k);
    u=max(0,y-k);
    for(int i=l;i<=r;i++)
    {
        if(mp[i][y]>mp[x][y])
        {
            ans=dfs(i,y);
            if(maxn<ans)
                maxn=ans;
        }

    }
    for(int i=u;i<=d;i++)
    {
        if(mp[x][i]>mp[x][y])
        {
            ans=dfs(x,i);
            if(maxn<ans)
                maxn=ans;
        }

    }
    dp[x][y]=maxn+mp[x][y];
    return dp[x][y];
}
int main()
{
    while(~scanf("%d%d",&n,&k))
    {
        if(n==-1&&k==-1)
        {
            break;
        }
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                scanf("%d",&mp[i][j]);
            }
        }
        memset(dp,0,sizeof dp);
        printf("%d\n",dfs(0,0));

    }
    return 0;
}

DP 94ms

#include<bits/stdc++.h>
using namespace std;
struct Node
{
    int x,y,v;
}node[105*105];
int dp[105][105];
int mp[105][105];
bool cmp(Node q,Node p)
{
    return q.v<p.v;
}
int main()
{
    int n,k;
    while(~scanf("%d%d",&n,&k))
    {
        int cnt=0;
        if(n==-1&&k==-1)
            break;
        for(int i=0;i<n;i++)
        {
            for(int j=0;j<n;j++)
            {
                scanf("%d",&mp[i][j]);
                if(i!=0||j!=0)
                {
                    node[cnt].x=i;
                    node[cnt].y=j;
                    node[cnt++].v=mp[i][j];
                }
            }
        }
        sort(node,node+cnt,cmp);
        memset(dp,-1,sizeof dp);
        dp[0][0]=mp[0][0];
        int ans=dp[0][0];
        for(int i=0;i<cnt;i++)
        {
            int x=node[i].x,y=node[i].y;
            for(int j=max(0,x-k);j<=min(n-1,x+k);j++)
            {
                if(mp[j][y]>=mp[x][y])
                    continue;
                if(dp[j][y]==-1)
                    continue;
                dp[x][y]=max(dp[x][y],dp[j][y]+mp[x][y]);
            }
            for(int j=max(0,y-k);j<=min(n-1,y+k);j++)
            {
                if(mp[x][j]>=mp[x][y])
                    continue;
                if(dp[x][j]==-1)
                    continue;
                dp[x][y]=max(dp[x][y],dp[x][j]+mp[x][y]);
            }
            ans=max(ans,dp[x][y]);
        }
        printf("%d\n",ans);
    }
    return 0;
}