[BOJ] 1912. 연속합(DP, 누적합)
#. Problemhttps://www.acmicpc.net/problem/1912* 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생각보다 단순한(?) 문제다.DP[N..
PS/Problem_Solving
2020. 6. 14. 18:51