FatMouse and Cheese HDU - 1078 dp

#include<cstdio>
#include<iostream>
#include<cstring>
using namespace std;
int n,k;
int dir[][]={{-,},{,},{,-},{,}};
int dp[][],mp[][];
bool check(int x,int y)
{
    if(x<||x>n||y<||y>n)
        return false;
    else
        return true;
}
int dfs(int x,int y)
{
    int ans=;
    if(!dp[x][y])
    {
        for(int j=;j<=k;j++)
        {
            for(int i=;i<;i++)
            {
                int xx=x+dir[i][]*j;
                int yy=y+dir[i][]*j;
                if(check(xx,yy)&&mp[xx][yy]>mp[x][y])
                        ans=max(ans,dfs(xx,yy));
                else
                    continue;
            }
        }
        dp[x][y]=ans+mp[x][y];
    }
    return dp[x][y];
}
int main()
{
    while(scanf("%d%d",&n,&k))
    {
        if(n==-&&k==-)
            break;
        for(int i=;i<=n;i++)
            for(int j=;j<=n;j++)
                scanf("%d",&mp[i][j]);
        //初始化
        memset(dp,,sizeof(dp));
        printf("%d\n",dfs(,));
    }
    return ;
}