题目 ：Problem - 1078 (hdu.edu.cn)
#include<bits/stdc++.h>
using namespace std;
int n,k,a[110][110],ans[110][110];
int dir[4][2]={
{0,1},{0,-1},{1,0},{-1,0}};
bool ok(int x,int y){if(x<0||x>=n||y<0||y>=n){return false;}return true;
}
int dfs(int x,int y){int answer=0;if(ans[x][y]){return ans[x][y];}for(int i=0;i<4;i++){for(int j=1;j<=k;j++){int xx=x+dir[i][0]*j;int yy=y+dir[i][1]*j;if(a[xx][yy]>a[x][y]&&ok(xx,yy)){answer=max(answer,dfs(xx,yy));}}}ans[x][y]=answer+a[x][y];return ans[x][y];
}
int main(){while(scanf("%d %d",&n,&k)==2){if(n==-1&&k==-1){break;}memset(ans,0,sizeof ans);for(int i=0;i<n;i++){for(int j=0;j<n;j++){scanf("%d",&a[i][j]);}}printf("%d\n",dfs(0,0));}return 0;
}