传送门
题目描述
给 n ∗ n n * n n∗n 矩阵只含 .或#,请用价值和最少的一堆长方形覆盖所有的 #,一个长方形的价值是长与宽的最大值
分析
因为数据范围不大,我们可以考虑爆搜
每次把一个搜索范围切割成两个子矩阵,然后计算子矩阵内最小的价值,最后进行状态转移即可
代码
#pragma GCC optimize(3)
#include <bits/stdc++.h>
#define debug(x) cout<<#x<<":"<<x<<endl;
#define dl(x) printf("%lld\n",x);
#define di(x) printf("%d\n",x);
#define _CRT_SECURE_NO_WARNINGS
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> PII;
typedef vector<int> VI;
const int INF = 0x3f3f3f3f;
const int N = 55;
const ll mod = 1000000007;
const double eps = 1e-9;
const double PI = acos(-1);
template<typename T>inline void read(T &a) {
char c = getchar(); T x = 0, f = 1; while (!isdigit(c)) {if (c == '-')f = -1; c = getchar();}
while (isdigit(c)) {x = (x << 1) + (x << 3) + c - '0'; c = getchar();} a = f * x;
}
int gcd(int a, int b) {return (b > 0) ? gcd(b, a % b) : a;}
char str[N][N];
int f[N][N][N][N];
int n;
int dfs(int x1,int y1,int x2,int y2){
if(f[x1][y1][x2][y2] != -1) return f[x1][y1][x2][y2];
if(x1 == x2 && y1 == y2){
f[x1][y1][x2][y2] = (str[x1][y1] == '#');
return f[x1][y1][x2][y2];
}
int res = max(x2 - x1 + 1,y2 - y1 + 1);
for(int i = x1;i < x2;i++) res = min(res,dfs(x1,y1,i,y2) + dfs(i + 1,y1,x2,y2));
for(int i = y1;i < y2;i++) res = min(res,dfs(x1,y1,x2,i) + dfs(x1,i + 1,x2,y2));
f[x1][y1][x2][y2] = res;
return res;
}
int main() {
read(n);
for(int i = 1;i <= n;i++) scanf("%s",str[i] + 1);
memset(f,-1,sizeof f);
dfs(1,1,n,n);
di(f[1][1][n][n]);
return 0;
}
/**
* ┏┓ ┏┓+ +
* ┏┛┻━━━┛┻┓ + +
* ┃ ┃
* ┃ ━ ┃ ++ + + +
* ████━████+
* ◥██◤ ◥██◤ +
* ┃ ┻ ┃
* ┃ ┃ + +
* ┗━┓ ┏━┛
* ┃ ┃ + + + +Code is far away from
* ┃ ┃ + bug with the animal protecting
* ┃ ┗━━━┓ 神兽保佑,代码无bug
* ┃ ┣┓
* ┃ ┏┛
* ┗┓┓┏━┳┓┏┛ + + + +
* ┃┫┫ ┃┫┫
* ┗┻┛ ┗┻┛+ + + +
*/