题意:
给你n*m的网格上有一些樱桃,每次可以用一刀切成两块,求最小切割长度,使得每一块蛋糕上只有一个樱桃?
思路:
记忆话搜索。
令dp[u][d][l][r]表示 在上界为u 下界为d,左边为l右边为r的矩形切割成只有1个樱桃的最小长度。
那么直接枚举切哪一刀记忆话搜索即可
#include <cstdio>
#include <cstring>
#include <algorithm>
using namespace std;
const int maxn = 30;
bool have[maxn][maxn];
int dp[maxn][maxn][maxn][maxn];
int vis[maxn][maxn][maxn][maxn];
int n,m,k,ks = 1;
int check(int u,int d,int l,int r){
int ans =0 ;
for (int i = u+1; i <= d; ++i){
for (int j = l+1; j <= r; ++j){
if (have[i][j])++ans;
}
}
return ans;
}
const int inf = 0x3f3f3f3f;
int dfs(int u,int d,int l,int r){
int& ans = dp[u][d][l][r];
if (vis[u][d][l][r] == ks) return ans;
vis[u][d][l][r] = ks;
int t = check(u,d,l,r);
if (t == 1)return ans = 0;
if (t == 0)return ans = inf;
ans = inf;
for (int i = u+1; i < d; ++i) {
ans = min(ans,dfs(u,i,l,r) + r-l + dfs(i,d,l,r));
}
for (int i = l+1; i < r; ++i){
ans = min(ans,dfs(u,d,l,i) + dfs(u,d,i,r)+d-u);
}
return ans;
}
int main(){
while(~scanf("%d %d %d",&n, &m, &k)){
memset(have,0,sizeof have);
for (int i = 0; i < k; ++i){
int x,y;
scanf("%d %d",&x, &y);
have[x][y] = 1;
}
if (k == 0){
printf("Case %d: %d\n",ks,0);
}
else printf("Case %d: %d\n",ks,dfs(0,n,0,m));
ks++;
}
return 0;
}