Download - Baekjoon Online Judge 1451번 풀이
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
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
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
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
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
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