Successfully reported this slideshow.
Upcoming SlideShare
×

# Baekjoon Online Judge 1451번 풀이

13,835 views

Published on

https://www.acmicpc.net/problem/1451 "직사각형으로 나누기" 문제 풀이입니다.

Published in: Technology
• Full Name
Comment goes here.

Are you sure you want to Yes No
• Dating direct: ❤❤❤ http://bit.ly/2Qu6Caa ❤❤❤

Are you sure you want to  Yes  No

Are you sure you want to  Yes  No

Are you sure you want to  Yes  No

Are you sure you want to  Yes  No

Are you sure you want to  Yes  No

### Baekjoon Online Judge 1451번 풀이

2. 2. • • • • • https://www.acmicpc.net/problem/1451
3. 3. • https://www.acmicpc.net/problem/1451
4. 4. • https://www.acmicpc.net/problem/1451
5. 5. • https://www.acmicpc.net/problem/1451
6. 6. • • • • • https://www.acmicpc.net/problem/1451
7. 7. • • • https://www.acmicpc.net/problem/1451
8. 8. • • • https://www.acmicpc.net/problem/1451
9. 9. • • • https://www.acmicpc.net/problem/1451
10. 10. • https://www.acmicpc.net/problem/1451
11. 11. • https://www.acmicpc.net/problem/1451
12. 12. • https://www.acmicpc.net/problem/1451
13. 13. • https://www.acmicpc.net/problem/1451
14. 14. • https://www.acmicpc.net/problem/1451
15. 15. • https://www.acmicpc.net/problem/1451
16. 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. 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. 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. 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. 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. 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. 22. • • https://gist.github.com/Baekjoon/84c8814011992f8efd8c • • https://gist.github.com/Baekjoon/94c5aace4cb174db5e9e https://www.acmicpc.net/problem/1451