每日一题_CodeForces_22B

链接

• 点此跳转

知识点

暴力枚举

思路和代码

枚举小矩形的边长，枚举小矩形的左上角的端点。

#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#include 
#define endl '\n'
#define PI acos(-1)
#define LL long long
#define INF 0x3f3f3f3f
#define lowbit(x) (-x&x)
#define mem(a, b) memset(a, b, sizeof a)
#define rev(x) reverse(x.begin(), x.end())
#define IOS ios::sync_with_stdio(false),cin.tie(0)

using namespace std;

const int N = 30;

int n, m;
char g[N][N];

int check(int a, int b, int x, int y) {
	if (x + a - 1 > n || y + b - 1 > m) return -1;
	
	for (int i = x; i < x + a; i ++ )
		for (int j = y; j < y + b; j ++ )
			if (g[i][j] == '1') return -1;
    
	return 2 * (a + b);
}

void solve() {
	cin >> n >> m;
	for (int i = 1; i <= n; i ++ ) 
		for (int j = 1; j <= m; j ++ )
			cin >> g[i][j];
		
	int res = -1;
	for (int a = 1; a <= n; a ++ )
		for (int b = 1; b <= m; b ++ ) {
			for (int i = 1; i <= n; i ++ )
				for (int j = 1; j <= m; j ++ )
					res = max(res, check(a, b, i, j));
		}
			
	cout << res << endl;
}

int main() {
	IOS;
	
	solve();
	
	return 0;
}
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67