BOJ 2410 2의 멱수의 합

https://www.acmicpc.net/problem/2410

https://github.com/simjaemun2/BaekJoon/blob/eff305dc05c1bbc24c3b6a1fdc5ed787eba24339/BOJ2410/BOJ2360.cpp

분류 : DP

난이도 : MH

무식한 DP 말고

f(n) = f(n-1) + f(n/2) 을 이용하면 선형 시간에 해결 가능하다.

BOJ 9251 LCS

https://www.acmicpc.net/problem/9251

https://github.com/simjaemun2/BaekJoon/blob/4202cc7ae0310e07677d9a567a41dcffb6655e7e/BOJ9251/BOJ9251.cpp

분류 : DP, LCS

난이도 : MH

BOJ 5582 공통 부분 문자열

https://www.acmicpc.net/problem/5582

https://github.com/simjaemun2/BaekJoon/blob/088991b2fb86182953ffa74279bc9688a30f44a9/BOJ5582/BOJ5582.cpp

분류 : DP, LCP

난이도 : MH

BOJ 1958 LCS 3

https://www.acmicpc.net/problem/1958

https://github.com/simjaemun2/BaekJoon/blob/4202cc7ae0310e07677d9a567a41dcffb6655e7e/BOJ9251/BOJ9251.cpp

분류 : DP, LCS

난이도 : MH

BOJ 1915 가장 큰 정사각형

https://www.acmicpc.net/problem/1915

https://github.com/simjaemun2/BaekJoon/blob/980a30027b9a027f1205449814fcad76d9da1b72/BOJ1915/BOJ1915.cpp

분류 : DP

난이도 : MH