[BOJ] 2167. 2차원 배열의 합(DP, 누적합).py.cpp
#. Problemhttps://www.acmicpc.net/problem/2167* 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최대 배열의 크기는 300x300 =..
PS/Problem_Solving
2020. 6. 4. 22:55