-
Notifications
You must be signed in to change notification settings - Fork 0
/
1451.cpp
91 lines (74 loc) · 2.04 KB
/
1451.cpp
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
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
#include<cstdio>
#include<climits>
#include<algorithm>
using namespace std;
int rect[100][100];
long long sum(int sx, int sy, int ex, int ey) {
long long ret = 0;
for (int i = sy; i <= ey; i++) {
for (int j = sx; j <= ex; j++) {
ret += rect[i][j];
}
}
return ret;
}
int main() {
int N, M;
long long answer = LLONG_MIN;
scanf("%d %d", &N, &M);
for (int i = 0; i < N; i++) {
for (int j = 0; j < M; j++) {
scanf("%1d", &rect[i][j]);
}
}
for (int i = 0; i < N - 2; i++) {
for (int j = i + 1; j < N - 1; j++) {
long long rect1 = sum(0, 0, M - 1, i);
long long rect2 = sum(0, i + 1, M - 1, j);
long long rect3 = sum(0, j + 1, M - 1, N - 1);
answer = max(answer, rect1*rect2*rect3);
}
}
for (int i = 0; i < M - 2; i++) {
for (int j = i + 1; j < M - 1; j++) {
long long rect1 = sum(0, 0, i, N - 1);
long long rect2 = sum(i + 1, 0, j, N - 1);
long long rect3 = sum(j + 1, 0, M - 1, N - 1);
answer = max(answer, rect1*rect2*rect3);
}
}
for (int i = 0; i < N - 1; i++) {
for (int j = 0; j < M - 1; j++) {
long long rect1 = sum(0, 0, M - 1, i);
long long rect2 = sum(0, i + 1, j, N - 1);
long long rect3 = sum(j + 1, i + 1, M - 1, N - 1);
answer = max(answer, rect1*rect2*rect3);
}
}
for (int i = 0; i < M - 1; i++) {
for (int j = 0; j < N - 1; j++) {
long long rect1 = sum(0, 0, i, N - 1);
long long rect2 = sum(i + 1, 0, M - 1, j);
long long rect3 = sum(i + 1, j + 1, M - 1, N - 1);
answer = max(answer, rect1*rect2*rect3);
}
}
for (int i = N - 1; i >= 1; i--) {
for (int j = 0; j < M - 1; j++) {
long long rect1 = sum(0, i, M - 1, N - 1);;
long long rect2 = sum(0, 0, j, i - 1);
long long rect3 = sum(j + 1, 0, M - 1, i - 1);
answer = max(answer, rect1*rect2*rect3);
}
}
for (int i = M - 1; i >= 1; i--) {
for (int j = 0; j < N - 1; j++) {
long long rect1 = sum(i, 0, M - 1, N - 1);
long long rect2 = sum(0, 0, i - 1, j);
long long rect3 = sum(0, j + 1, i - 1, N - 1);
answer = max(answer, rect1*rect2*rect3);
}
}
printf("%lld\n", answer);
return 0;
}