UVa 1629

题目大意是给定一个n * m的蛋糕，蛋糕上可能会有樱桃，每次只能沿轴线切一刀，求最少的能使每一块蛋糕至少只有一个樱桃的

最小长度。

思路

记忆化搜索

问题本身不难，状态就是给定每块蛋糕的左上角和右下角，然后记忆化搜索即可，同时注意切蛋糕一定要保证每一刀分开的两个蛋

糕都至少有一个樱桃。

#include <bits/stdc++.h>
using namespace std;
const int maxn = 20 + 10;
int n, m, K;
int d[maxn][maxn][maxn][maxn];
bool vis[maxn][maxn][maxn][maxn];
int cake[maxn][maxn];

inline int judge(int tr, int tc, int br, int bc){
    int cnt = 0;
    for(int i = tr + 1; i <= br; ++i)
    for(int j = tc + 1; j <= bc; ++j){
        if(cake[i][j]) cnt++;
        if(cnt > 1) return cnt;
    }
    return cnt;
}

int dp(int tr, int tc, int br, int bc){
    int & val = d[tr][tc][br][bc];
    if(vis[tr][tc][br][bc]) return val;
    vis[tr][tc][br][bc] = true;
    int judgement = judge(tr, tc, br, bc);
    if(judgement == 0) return val = -1;
    else if(judgement == 1) return val = 0;
    val = 100000000;
    if(br - 1 > tr){
        for(int k = tr + 1; k < br; ++k){
            int A = dp(k, tc, br, bc);
            int B = dp(tr, tc, k, bc);
            if(A == - 1 || B == -1) continue;
            val = min(val, A + B + bc - tc);
        }
    }
    if(bc - 1 > tc){
        for(int k = tc + 1; k < bc; ++k){
            int A = dp(tr, tc, br, k);
            int B = dp(tr, k, br, bc);
            if(A == -1 || B == -1) continue;
            val = min(val, A + B + br - tr);
        }
    }
    return val;
}

void init(){
    memset(d, 0, sizeof(d));
    memset(cake, 0, sizeof cake);
    memset(vis, false, sizeof(vis));
}

int main()
{
    int kase = 0;
    while(scanf("%d%d%d", &n, &m, &K) == 3){
        init();
        for(int i = 1; i <= K; ++i) {
            int r, c; scanf("%d%d", &r, &c);
            cake[r][c] = 1;
        }
        int res = dp(0, 0, n, m);
        printf("Case %d: %d\n", ++kase, res == -1 ? 0 : res);
    }
    return 0;
}