The document contains code snippets for solving problem 1451 on the Algorithm Problem Solving website acmicpc.net. It includes nested for loops calculating the sums of subsets in different ranges of a 2D array and updating the maximum value of their product. The code is testing all possible combinations of splitting the 2D space into three partitions.

1. choi@startlink.io

2. •
•
•
•
•
https://www.acmicpc.net/problem/1451

3. •
https://www.acmicpc.net/problem/1451

4. •
https://www.acmicpc.net/problem/1451

5. •
https://www.acmicpc.net/problem/1451

6. •
•
•
•
•
https://www.acmicpc.net/problem/1451

7. •
•
•
https://www.acmicpc.net/problem/1451

8. •
•
•
https://www.acmicpc.net/problem/1451

9. •
•
•
https://www.acmicpc.net/problem/1451

10. •
https://www.acmicpc.net/problem/1451

11. •
https://www.acmicpc.net/problem/1451

12. •
https://www.acmicpc.net/problem/1451

13. •
https://www.acmicpc.net/problem/1451

14. •
https://www.acmicpc.net/problem/1451

15. •
https://www.acmicpc.net/problem/1451

16. for (int i=1; i<=m-2; i++) {
for (int j=i+1; j<=m-1; j++) {
long long r1 = sum(1,1,n,i);
long long r2 = sum(1,i+1,n,j);
long long r3 = sum(1,j+1,n,m);
if (ans < r1*r2*r3) {
ans = r1*r2*r3;
}
}
}
https://www.acmicpc.net/problem/1451

17. for (int i=1; i<=n-2; i++) {
for (int j=i+1; j<=n-1; j++) {
long long r1 = sum(1,1,i,m);
long long r2 = sum(i+1,1,j,m);
long long r3 = sum(j+1,1,n,m);
if (ans < r1*r2*r3) {
ans = r1*r2*r3;
}
}
}
https://www.acmicpc.net/problem/1451

18. for (int i=1; i<=n-1; i++) {
for (int j=1; j<=m-1; j++) {
long long r1 = sum(1,1,n,j);
long long r2 = sum(1,j+1,i,m);
long long r3 = sum(i+1,j+1,n,m);
if (ans < r1*r2*r3) {
ans = r1*r2*r3;
}
}
}
https://www.acmicpc.net/problem/1451

19. for (int i=1; i<=n-1; i++) {
for (int j=1; j<=m-1; j++) {
long long r1 = sum(1,1,i,j);
long long r2 = sum(i+1,1,n,j);
long long r3 = sum(1,j+1,n,m);
if (ans < r1*r2*r3) {
ans = r1*r2*r3;
}
}
}
https://www.acmicpc.net/problem/1451

20. for (int i=1; i<=n-1; i++) {
for (int j=1; j<=m-1; j++) {
long long r1 = sum(1,1,i,m);
long long r2 = sum(i+1,1,n,j);
long long r3 = sum(i+1,j+1,n,m);
if (ans < r1*r2*r3) {
ans = r1*r2*r3;
}
}
}
https://www.acmicpc.net/problem/1451

21. for (int i=1; i<=n-1; i++) {
for (int j=1; j<=m-1; j++) {
long long r1 = sum(1,1,i,j);
long long r2 = sum(1,j+1,i,m);
long long r3 = sum(i+1,1,n,m);
if (ans < r1*r2*r3) {
ans = r1*r2*r3;
}
}
}
https://www.acmicpc.net/problem/1451

22. •
• https://gist.github.com/Baekjoon/84c8814011992f8efd8c
•
• https://gist.github.com/Baekjoon/94c5aace4cb174db5e9e
https://www.acmicpc.net/problem/1451