hdu 1078 FatMouse and Cheese 메모리 검색/동적 계획

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define N 110
using namespace std;

int a[N][N],n,k,d[N][N];

int dfs(int x,int y)
{
    if(!d[x][y])
    {
        int ans=0;
        for(int i=-k;i<=k;i++)
        {
            if(i==0)    continue;
            int tx=x+i,ty=y+i;
            if(tx>=0&&tx<n&&a[tx][y]>a[x][y])
                ans=max(ans,dfs(tx,y));
            if(ty>=0&&ty<n&&a[x][ty]>a[x][y])
                ans=max(ans,dfs(x,ty));
        }
        d[x][y]=ans+a[x][y];
    }
    return d[x][y];
}

int main()
{
    while(~scanf("%d%d",&n,&k)&&!(n==-1&&k==-1))
    {
        for(int i=0;i<n;i++)
            for(int j=0;j<n;j++)
                scanf("%d",&a[i][j]);
        memset(d,0,sizeof(d));
        dfs(0,0);
        cout<<d[0][0]<<endl;
    }
}

#include <iostream>
#include<cstdio>
#include<cstring>
#include<cmath>
#include<algorithm>
#define N 11000
using namespace std;

struct node
{
    int c,num;
}b[N];

bool cmp(node a,node b)
{
    return a.c<b.c;
}

int n,k,d[N],a[N];

int main()
{
    while(~scanf("%d%d",&n,&k)&&!(n==-1&&k==-1))
    {
        for(int i=0;i<n*n;i++)
        {
            scanf("%d",&a[i]);
            d[i]=b[i].c=a[i];
            b[i].num=i;
        }
        sort(b,b+n*n,cmp);
        for(int i=n*n-1;i>=0;i--)
        {
            for(int j=-k;j<=k;j++)
            {
                if(j==0) continue;
                int tp=b[i].num;
                int x=tp/n,y=tp%n;
                int t1=(x+j)*n+y,t2=x*n+y+j;
                if(x+j>=0&&x+j<n&&a[t1]>a[tp])
                    d[tp]=max(d[tp],d[t1]+a[tp]);
                if(y+j>=0&&y+j<n&&a[t2]>a[tp])
                    d[tp]=max(d[tp],d[t2]+a[tp]);
            }
        }
        cout<<d[0]<<endl;
    }
}