HDU 1078 FatMouse and Cheese 记忆化搜索

题意：在$N*N$的矩阵里找一个递增的权值最大的链，问这个权值是多少？

思路：记忆化搜索，我开始也是蠢，直接搜，然而发现有太多状态都是重复的，还妄想借助流氓剪枝过，我要忏悔。

http://acm.hdu.edu.cn/showproblem.php?pid=1078

/*********************************************
    Problem : HDU 1078
    Author  : NMfloat
    InkTime (c) NM . All Rights Reserved .
********************************************/

#include <map>
#include <set>
#include <queue>
#include <cmath>
#include <ctime>
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <iostream>
#include <algorithm>

#define rep(i,a,b)  for(int i = (a) ; i <= (b) ; i ++)
#define rrep(i,a,b) for(int i = (b) ; i >= (a) ; i --)
#define repE(p,u) for(Edge * p = G[u].first ; p ; p = p -> next)
#define cls(a,x)   memset(a,x,sizeof(a))
#define eps 1e-8

using namespace std;

const int MOD = 1e9+7;
const int INF = 0x3f3f3f3f;
const int MAXN = 1e5+5;
const int MAXE = 2e5+5;

typedef long long LL;
typedef unsigned long long ULL;

int T,n,m,k;

int fx[] = {0,1,-1,0,0};
int fy[] = {0,0,0,-1,1};

int Map[105][105];
int ret[105][105];//由(i,j)到达的最大值;

void dfs(int x,int y) {
    int tmp = 0;
    rep(i,1,4) { 
        rep(ia,1,k) {
            int tmpx = x + fx[i] * ia; 
            int tmpy = y + fy[i] * ia;
            if(tmpx >= 1 && tmpx <= n && tmpy >= 1 && tmpy <= n && Map[tmpx][tmpy] > Map[x][y]) {
                if(!ret[tmpx][tmpy]) {
                    dfs(tmpx,tmpy);
                }
                tmp = max(tmp,ret[tmpx][tmpy]);
            } 
        }
    }
    ret[x][y] = Map[x][y] + tmp;
}

void input() {
    rep(i,1,n) rep(j,1,n) scanf("%d",&Map[i][j]);
}

void solve() {
    cls(ret,0);
    dfs(1,1);
    printf("%d\n",ret[1][1]);
}

int main(void) {
    //freopen("a.in","r",stdin);
    //scanf("%d",&T); while(T--) {
    while(scanf("%d %d",&n,&k),n+1) {
    //while(scanf("%d",&n),n) {
        input();
        solve();
    }
    return 0;
}