题解 - CF Rectangle Painting 1
题目链接:http://codeforces.com/problemset/problem/1198/D
题意
给你一个 50*50 的矩阵,上面覆盖着任意个黑块,我们可以用一些矩形覆盖黑块,每次覆盖的花费是max(矩形的长,矩形的宽),问最小花费是多少?
思路
记忆化搜索,每次搜索一个矩形块,枚举其横着切,竖着切的情况,返回花费最小的值
代码
#include <bits/stdc++.h>
using namespace std;
#define rep(i,j,k) for(int i = (int)j;i <= (int)k;i ++)
#define debug(x) cerr<<#x<<":"<<x<<endl
#define pb push_back
typedef long long ll;
typedef pair<int,int> pi;
const int MAXN = (int)1e6+7;
char pic[60][60];
int dp[60][60][60][60];
inline int dfs(int l,int u,int r,int d) {
if (dp[l][u][r][d] != -1) return dp[l][u][r][d];
if (l==r&&u==d) return dp[l][u][r][d] = (pic[l][u] == '#');
dp[l][u][r][d] = max(r-l+1,d-u+1);
rep(i,l,r-1) {
dp[l][u][r][d] = min(dfs(l,u,i,d)+dfs(i+1,u,r,d),dp[l][u][r][d]);
}
rep(i,u,d-1) {
dp[l][u][r][d] = min(dfs(l,u,r,i)+dfs(l,i+1,r,d),dp[l][u][r][d]);
}
return dp[l][u][r][d];
}
int main()
{
int N;
cin >> N;
rep(i,1,N) cin >> pic[i]+1;
memset(dp,-1,sizeof(dp));
int ans = dfs(1,1,N,N);
cout << ans << endl;
}