[BOJ] 1915. 가장 큰 정사각형(DP).py.cpp
#. Problemhttps://www.acmicpc.net/problem/1915* The copyright in this matter is in BOJ #. Resolution Process 1. Read and understand problem 2. Redefine the problem + abstract 3. Create solution plan (select Algorithm, Data structure) 4. Prove the plan (check performance time and usage memory) 5. Carry out the plan 6. Look back on the plan and find a way to improve it #. Solve유형만 잘 파악하면 되는 문제라고 하..
PS/Problem_Solving
2020. 6. 5. 11:35